#include "cmp.h"
void remember(int n){
int a[4]; int pos = 3;
while(pos >= 0){
a[pos--] = (n % 8); n/=8;
}
int cur = 1;
for(int i=0;i<4;i++){
cur = cur * 8 + a[i];
bit_set(cur);
}
}
int compare(int b) {
int n = b;
int a[4]; int pos = 3;
while(pos >= 0){
a[pos--] = (n % 8); n/=8;
}
int cur = 1; int i = 0;
for(;i<4;i++){
cur = cur * 8 + a[i];
int bit = bit_get(cur);
if(!bit) break;
}
if(i == 4)return 0;
cur /= 8;
int chk = 0;
if(a[i] == 0)return -1;
if(a[i] == 7)return 1;
for(int k = 1; k < 8 ;k++){
int bit = bit_get(cur * 8+k);
if(bit == 1) chk = k;
}
if(chk > a[i]) return -1;
return 1;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Partially correct |
2341 ms |
99668 KB |
Output is partially correct - maxAccess = 15, score = 55 |