OJ Board

Code: Select all

/* Naughty sleepy boys (10427) */
#include <stdio.h>

char string[20];
int i, rem, m;
long long int n, class[9], maxValue[9], j, k, before, offset;

int main(void)  {
    class[0] = 9L;
    class[1] = 180L;
    class[2] = 2700L;
    class[3] = 36000L;
    class[4] = 450000L;
    class[5] = 5400000L;
    class[6] = 63000000L;
    class[7] = 720000000L;
    class[8] = 8100000000L;

    maxValue[0] = 9L;
    maxValue[1] = 99L;
    maxValue[2] = 999L;
    maxValue[3] = 9999L;
    maxValue[4] = 99999L;
    maxValue[5] = 999999L;
    maxValue[6] = 9999999L;
    maxValue[7] = 99999999L;
    maxValue[8] = 999999999L;

    while(scanf("%ld", &n) != EOF)      {
         for(i = 0; i < 9; i++)
                if(n < class[i])  {
	      if( n <  10)
	          printf("%ld\n", n);
	      else
	      {  
                          before = 0;
	          for(m = 0; m < i; m++)
                                before += class[m];

	          offset = n - before;

	          k = offset / (i+1);
	          if(offset % (i+1))
                                k++;

	          j = maxValue[i-1] + k;
	          sprintf(string, "%ld", j);
	          rem = offset%(i+1);

	          if(rem == 0 && i == 1)
                                rem = 2;

	          if(rem == 0)
                                rem++;

	          printf("%c\n", string[rem-1]);
                     }
                     break;
               }
      }

      return 0;
}

Code: Select all

3
9
1
0
7
1
1
4
4
1
7
0
2
0
4
0
6
1
1
2
0
8
6