1871888_re.c

北大大牛代码 1240道题的原代码 超级权威

# include <stdio.h>
# include <math.h>

int main()
{
  long roman[500001];
  long m, i, tmp;
  long mark[500001];

  roman[0] = 0;
  mark[0] = (long)pow(2,15);
  for(m = 1; m < 501; m++)
	  mark[m] = 0;
  for(m = 1; m <= 500000; m++)
  {
   tmp = roman[m-1] - m;

   if(tmp<=0||mark[tmp/32]&(long)pow(2,31-tmp%32))
     tmp = roman[m-1] + m;
   mark[tmp/32] |= (long)pow(2,31-tmp%32 );
   roman[m] = tmp;
  }
  while(scanf("%ld",&m)==1&&m!=-1)
   printf("%ld\n",roman[m]);
   return 0;
}