#include "cmp.h"
void remember(int n) {
n = n + 1;
int target = 2048;
int shift = 10;
while (true) {
if (shift == -2) {
bit_set(4096);
break;
}
if (target < n) {
bit_set(target);
target += (1 << shift);
}
else if (target > n) {
bit_set(target);
target -= (1 << shift);
}
else {
bit_set(target);
break;
}
shift--;
}
}
int compare(int b) {
int target = 2048;
int shift = 10;
if (bit_get(target) == 1) {
while (true) {
if (shift < 0)
break;
if (bit_get(target + (1 << shift)))
target += (1 << shift);
else if (bit_get(target - (1 << shift)))
target -= (1 << shift);
else
break;
shift--;
}
}
if (target - 1> b)
return -1;
else if (target - 1 < b)
return 1;
else
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1593 ms |
87928 KB |
ZERO POINTS: For a=4095 and b=4094, correct answer is -1, got 0 |