0
Your rating: None
CodeChef submission 252973 (C) 

CodeChef submission 252973 (C) plaintext list. Status: WA, problem COINS, contest . By manjotpahwa (manjotpahwa), 2010-06-06 11:43:04.
  1. //WORKING ON MY PC BUT SHOWING WA
  2.  
  3. #include<stdio.h>
  4. #include<stdlib.h>
  5. #define SIZE 1000001
  6.  
  7. long long *arr=NULL;
  8. long long sum(long long n);
  9. //long long max(long long a, long long b);
  10. int main()
  11. {
  12. int i=0, flag;
  13. long long n, j, ans;
  14. arr=(long long *)malloc(SIZE*sizeof(long long));
  15. for(j=0;j<12;j++)
  16. arr[j]=j;
  17. while(i<=9)
  18. 	{
  19. 	flag=scanf("%lld", &n); if(flag!=1) break;
  20. 	ans=sum(n);
  21. 	printf("%lld\n", ans);
  22. 	i++;
  23. 	}
  24. return 0;
  25. }
  26. long long sum(long long n)
  27. {
  28. long long temp;
  29. if(n==0) return n;
  30. if(n<SIZE && arr[n]!=0)
  31. return arr[n];
  32.  
  33. temp=sum(n/2)+sum(n/3)+sum(n/4);
  34. if(temp>n)
  35. {
  36. if(n<SIZE){
  37. arr[n]=temp;
  38. return temp;}
  39. }
  40. else if(temp<n)
  41. {if(n<SIZE){
  42. arr[n]=n;
  43. return n;}
  44. }
  45. }
  46. /*
  47. arr[n]=max(n,temp);
  48. return arr[n];
  49. }
  50. long long max(long long a, long long b)
  51. {return (a>b)?a:b;}*/

Comments