0
Your rating: None
CodeChef submission 475504 (C) 

CodeChef submission 475504 (C) plaintext list. Status: WA, problem MIXTURES, contest . By mayank_gupta (mayank_gupta), 2011-03-02 18:29:12.
  1. //mayank gupta
  2.  
  3. #include<stdio.h>
  4. //#include<malloc.h>
  5.  
  6. int main()
  7. {
  8. 	int ar[101][101];
  9. 	int i, j, m;
  10. 	int min, s, k;
  11.  
  12. 	// ar = (int*)malloc(n*sizeof(int) );
  13.  
  14. 	while(scanf("%d", &m) == 1)
  15. 	{
  16. 		s = 0;
  17. 		for(i=0;i<m;i++)
  18. 			scanf("%d", &ar[1][i]);
  19.  
  20. 		for(i=2;i<=m;i++)
  21. 		{
  22. 			for(j=0;j<=(m-i);j++)
  23. 			{
  24. 				ar[i][j] = (ar[i-1][j] + ar[i-1][j+1])%100;
  25. 			}
  26.  
  27. 			min = ar[i][0];
  28. 			for(j=0;j<=(m-i);j++)
  29. 			{
  30. 				if(ar[i][j] < min)
  31. 					min = ar[i][j];
  32. 			}
  33.  
  34. 			k = 0;
  35. 			for(j=0;j<=(m-i);j++)
  36. 			{
  37. 				if(ar[i][j] != min)
  38. 				{
  39. 					ar[i][j] = ar[i-1][k];
  40. 				}
  41. 				else
  42. 				{
  43. 					ar[i][j] = min;
  44. 					s = s + (ar[i-1][j] * ar[i-1][j+1]);
  45. //					printf("s=%d\n", s);
  46. 					k++;
  47. 				}
  48. //				printf("ar[%d][%d]=%d\n", i, j, ar[i][j]);
  49. 				k++;
  50. 			}
  51. 		}
  52.  
  53. 		printf("%d\n", s);
  54. 	}
  55.  
  56. return 0;
  57. }
  58.

Comments