oj.uz

Submission #24125

# Submission time Handle Problem Language Result Execution time Memory
24125 2017-05-31T11:01:22 Z ms990606 cmp (balkan11_cmp) C
0 / 100
 943 ms 82552 KB 
#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) {
  int 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;
}

Subtask #1
0.0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 943 ms 82552 KB ZERO POINTS: For a=1542 and b=1771, correct answer is 1, got -1