SPOJ- Will It Ever Stop (WILLITST) Problem O(1) Solution
Solution:-
using namespace std;
int main()
{
long long int num;
cin>>num;
if(num<=1 || !(num&num-1))
cout<<"TAK";
else
cout<<"NIE";
return 0;
}
Here, you may find the solutions to famous problems of various coding platforms like SPOJ || HACKEREARTH etc. Please leave a comment in case you need solution or editorial to any problem. Get Solutions || Editorials of Famous DP problems. Happy Coding :)