# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
24124 | ms990606 | cmp (balkan11_cmp) | C11 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "cmp.h"
void remember(int n) {
int a[13],ans=0;
for(int i=0;i<12;i++)
{
a[i]=((n&(1<<(11-i)))?1:0);
ans+=a[i];
}
if(ans>6)
{
bit_set(1);
for(int i=0;i<12;i++)
{
if(a[i]==0) bit_set(i+2);
}
}
else
{
for(int i=0;i<12;i++)
{
if(!a[i]) bit_set(i+2);
}
}
}
int compare(int b) {
a=bit_get(1);
int c[13],d[13];
for(int i=0;i<12;i++)
{
c[i]=((b&(1<<(11-i)))?1:0);
d[i]=(bit_get(i+2)+a)%2;
if(c[i]>d[i]) return 1;
if(c[i]<d[i]) return -1;
}
return 0;
}