SPOJ WILLITST Solution

| July 01, 2015

The correct, optimal and working solution for programming question WILLITST on spoj

#include <stdio.h>

int main( int argc , char * argv[] ) {

	unsigned long long int n;
	scanf("%lld" , &n);

	if ( (n & (n-1)) == 0)
		printf("TAK\n");
	else
		printf("NIE\n");

	return 0;
}