0
Your rating: None
CodeChef submission 648479 (C) 

CodeChef submission 648479 (C) plaintext list. Status: AC, problem F6, contest . By avinashmagicc (avinashmagicc), 2011-09-06 06:59:26.
  1.     #include <stdio.h>
  2.     #include <math.h>
  3.     double vals[5001];
  4.     int numbering[5001];
  5.     int main()
  6.     {
  7.     int ans,valc,bot,number,top;
  8.     double scale,temp;
  9.     double sum,next,logscale,log2;
  10.     int i;
  11.     scanf("%lf",&scale);
  12.     temp = 0.00000001;
  13.     scale-=temp;
  14.     logscale = log(scale);
  15.     log2 = log(2);
  16.     ans = (int)(logscale/(log2 - logscale))+1;
  17.     valc = 2;
  18.     vals[0] = 1;
  19.     vals[1] = 1;
  20.     sum = 2;
  21.     for (i=2; i<2*ans; i+=2)
  22.     {
  23.     next = 2/scale*vals[i-1];
  24.     vals[i] = next;
  25.     vals[i+1] = next;
  26.     sum = sum + 2*next;
  27.     valc = valc + 2;
  28.     }
  29.     for (i=0; i<valc; i++)
  30.     {
  31.     vals[i] = vals[i]/sum;
  32.     }
  33.     bot = 0;
  34.     top = valc;
  35.     while (top-bot>1)
  36.     {
  37.     vals[top++] = vals[bot] + vals[bot+1];
  38.     bot+=2;
  39.     }
  40.     numbering[top-1]=0;
  41.     printf("%d\n",valc);
  42.     number = 1;
  43.     for (i=0; i<valc-1; i++)
  44.     {
  45.     printf("%d %.15f\n",numbering[top-1],vals[bot-2]);
  46.     numbering[bot-1]=numbering[top-1];
  47.     numbering[bot-2]=number++;
  48.     bot-=2;
  49.     top--;
  50.     }
  51.     return 0;
  52.     }
  53.

Comments