import java.io.BufferedOutputStream;
import java.io.DataInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.util.ArrayList;
import java.util.List;
public class ilo {
private static Parser input = new Parser(System.in);
private static BufferedOutputStream output = new BufferedOutputStream(System.out);
public static void main(String[] args) throws IOException {
Solver solver = new Solver();
int n = input.nextInt();
for (int i = 0; i < n; i++) {
output.write((solver.solve(input.nextInt()) + "\n").getBytes());
}
output.flush();
}
}
class Solver {
private static final int MAX_FIB_NUMBER = 1_000_000_000;
private List<Integer> fibNumbers;
public Solver() {
fibNumbers = new ArrayList<>();
int prev = 1;
int current = 2;
fibNumbers.add(prev);
while (current < MAX_FIB_NUMBER) {
fibNumbers.add(current);
current += prev;
prev = current - prev;
}
}
public String solve(int val) {
boolean result = false;
for (Integer divisor : fibNumbers) {
if (val % divisor == 0) {
if (fibNumbers.contains(val / divisor)) {
result = true;
break;
}
}
}
return result || val == 0 ? "TAK" : "NIE";
}
}
class Parser {
final private int BUFFER_SIZE = 1 << 16;
private DataInputStream din;
private byte[] buffer;
private int bufferPointer, bytesRead;
public Parser(InputStream in) {
din = new DataInputStream(in);
buffer = new byte[BUFFER_SIZE];
bufferPointer = bytesRead = 0;
}
public int nextInt() throws IOException {
int ret = 0;
byte c = read();
while (c <= ' ')
c = read();
boolean neg = c == '-';
if (neg)
c = read();
do {
ret = ret * 10 + c - '0';
c = read();
} while (c > ' ');
if (neg)
return -ret;
return ret;
}
private void fillBuffer() throws IOException {
bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);
if (bytesRead == -1)
buffer[0] = -1;
}
private byte read() throws IOException {
if (bufferPointer == bytesRead)
fillBuffer();
return buffer[bufferPointer++];
}
}
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 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 | import java.io.BufferedOutputStream; import java.io.DataInputStream; import java.io.IOException; import java.io.InputStream; import java.util.ArrayList; import java.util.List; public class ilo { private static Parser input = new Parser(System.in); private static BufferedOutputStream output = new BufferedOutputStream(System.out); public static void main(String[] args) throws IOException { Solver solver = new Solver(); int n = input.nextInt(); for (int i = 0; i < n; i++) { output.write((solver.solve(input.nextInt()) + "\n").getBytes()); } output.flush(); } } class Solver { private static final int MAX_FIB_NUMBER = 1_000_000_000; private List<Integer> fibNumbers; public Solver() { fibNumbers = new ArrayList<>(); int prev = 1; int current = 2; fibNumbers.add(prev); while (current < MAX_FIB_NUMBER) { fibNumbers.add(current); current += prev; prev = current - prev; } } public String solve(int val) { boolean result = false; for (Integer divisor : fibNumbers) { if (val % divisor == 0) { if (fibNumbers.contains(val / divisor)) { result = true; break; } } } return result || val == 0 ? "TAK" : "NIE"; } } class Parser { final private int BUFFER_SIZE = 1 << 16; private DataInputStream din; private byte[] buffer; private int bufferPointer, bytesRead; public Parser(InputStream in) { din = new DataInputStream(in); buffer = new byte[BUFFER_SIZE]; bufferPointer = bytesRead = 0; } public int nextInt() throws IOException { int ret = 0; byte c = read(); while (c <= ' ') c = read(); boolean neg = c == '-'; if (neg) c = read(); do { ret = ret * 10 + c - '0'; c = read(); } while (c > ' '); if (neg) return -ret; return ret; } private void fillBuffer() throws IOException { bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE); if (bytesRead == -1) buffer[0] = -1; } private byte read() throws IOException { if (bufferPointer == bytesRead) fillBuffer(); return buffer[bufferPointer++]; } } |
English