#include <stdio.h> #include <stdlib.h> int f[] = {1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181, 6765, 10946, 17711, 28657}; void test(int l) { if (l == 0) { printf("TAK\n"); return; } int i; for (i=0; (i<22) && (l>=f[i]); i++) { if (l%f[i]==0) { int g = l/f[i]; int j; for (j=i; (j<22) && (g>=f[j]); j++) { if (g==f[j]) { printf("TAK\n"); return; } } } } printf("NIE\n"); } int main() { int n; scanf("%d",&n); while (n--) { int l; scanf("%d",&l); test(l); } return 0; }
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 | #include <stdio.h> #include <stdlib.h> int f[] = {1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181, 6765, 10946, 17711, 28657}; void test(int l) { if (l == 0) { printf("TAK\n"); return; } int i; for (i=0; (i<22) && (l>=f[i]); i++) { if (l%f[i]==0) { int g = l/f[i]; int j; for (j=i; (j<22) && (g>=f[j]); j++) { if (g==f[j]) { printf("TAK\n"); return; } } } } printf("NIE\n"); } int main() { int n; scanf("%d",&n); while (n--) { int l; scanf("%d",&l); test(l); } return 0; } |