Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
4149 coj TL
#include <iostream> #include <map> using namespace std; bool jugada(int n) { if(n&1) return false; return !jugada(n/2); } int main() { int T, N; cin >> T; while(T--) { cin >> N; if(jugada(N)) cout << "TAK\n"; else cout << "NIE\n"; } }
run
|
edit
|
history
|
help
0
nobita's candies problem
ArrAdSubMul
Get all anagrams from given words
maximum nights you can accommodate
ExceptionHandling3
Policy based smart pointer
Let's Go!
c2p_update
Policy based smart pointer
sysFork3