| Task: | Bittijono |
| Sender: | MM |
| Submission time: | 2016-10-03 18:57:25 +0300 |
| Language: | Java |
| Status: | READY |
| Result: | 29 |
| group | verdict | score |
|---|---|---|
| #1 | ACCEPTED | 10 |
| #2 | ACCEPTED | 19 |
| #3 | RUNTIME ERROR | 0 |
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | ACCEPTED | 0.16 s | 1 | details |
| #2 | ACCEPTED | 0.90 s | 2 | details |
| #3 | RUNTIME ERROR | 0.14 s | 3 | details |
Code
import java.util.Scanner;
public class Bittijono {
private static final int[] first16 = {1, -1, -1, 1, -1, 1, 1, -1, -1, 1, 1, -1, 1, -1, -1, 1};
public static void main(String[] args) {
Scanner reader = new Scanner(System.in);
int loop = reader.nextInt();
int i;
long[] numbers = new long[loop];
for (i=0;i<loop;i++)
numbers[i] = reader.nextInt();
for (i=0;i<loop;i++) {
if (findNumber(numbers[i]) == -1)
System.out.println(1);
else
System.out.println(0);
}
reader.close();
}
private static long findNumber(long index) {
//FIND DIV SIZE
if (index == 0)
return -1;
if (index<17)
return first16[(int) (index-1)];
long i = 0;
for(i=1;i*4<index;i*=4);
int blockNumber = (int) -Math.floorDiv(-index, i);
return findNumber(index - (blockNumber-1) * i) * first16[blockNumber-1];
}
}
Test details
Test 1
Group: 1
Verdict: ACCEPTED
| input |
|---|
| 100 62 9 12 73 ... |
| correct output |
|---|
| 1 1 1 0 1 ... |
| user output |
|---|
| 1 1 1 0 1 ... |
Test 2
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 100000 565433 141881 120108 825392 ... |
| correct output |
|---|
| 1 1 0 0 1 ... |
| user output |
|---|
| 1 1 0 0 1 ... |
Test 3
Group: 3
Verdict: RUNTIME ERROR
| input |
|---|
| 100000 374768524402011755 937067109466254318 389256426086302899 932585725667010169 ... |
| correct output |
|---|
| 0 1 1 1 1 ... |
| user output |
|---|
| (empty) |
Error:
Exception in thread "main" java.util.InputMismatchException: For input string: "374768524402011755" at java.util.Scanner.nextInt(Scanner.java:2123) at java.util.Scanner.nextInt(Scanner.java:2076) at Bittijono.main(Bittijono.java:12)
