0
Your rating: None
CodeChef submission 136783 (C) 

CodeChef submission 136783 (C) plaintext list. Status: TLE, problem SNCK04, contest SNACKDWN. By Berserk-gang (Berserk-gang), 2009-11-21 23:57:04.
  1. #include<stdio.h>
  2. #include<math.h>
  3. //#include<conio.h>
  4. int subt(int n)
  5. {
  6. int s=0,pc=0,i,k,sk,nc,l;
  7. int p[5000000][2];
  8. for(i=0;i<5000000;i++)
  9. p[i][0]=0;
  10. for(k=2;k<=n;k++)
  11. {
  12. for(i=0;i<5000000;i++)
  13. p[i][1]=0;
  14. sk=0; nc=0; i=0; l=k;
  15. while(i<pc)
  16. {
  17. if(l%p[i][0]==0)
  18. {
  19. //printf("<%d>{%d}",k,p[i][0]);
  20. p[i][1]++;
  21. l/=p[i][0];
  22. }
  23. else i++;
  24. }
  25. for(i=0;i<pc;i++)
  26. if(p[i][1]!=0)
  27. {
  28. nc++;
  29. sk+=(p[i][1]-1);
  30. }
  31. if(nc==0)
  32. {
  33. p[pc][0]=k;
  34. pc++;
  35. }
  36. else
  37. sk+=pow(2,nc-1);
  38. s+=sk;
  39. }
  40. //printf("%d",s);
  41. return s;
  42. }
  43. int main()
  44. {
  45. int i,n,t,l;
  46. scanf("%d",&t);
  47. for(i=0;i<t;i++)
  48. {
  49. scanf("%d",&n);
  50. if(n%2==0)
  51. l=n-1;
  52. else
  53. l=n;
  54. l*=(n/2);
  55. l-=subt(n);
  56. printf("%d\n",l);
  57. }
  58. scanf("%d",&i);
  59. //return 0;
  60. }

Comments