fork(2) download
copy 
  1. #include <stdio.h>
  2.  
  3. int main(void) { 
  4. 	int x;
  5. 	for(; scanf("%d",&x) > 0 && x != 42; printf("%d\n", x));
  6.  
  7.  
  8. int numb_stones = 7;
  9. int numb_piles = 3;
  10. long total_combination_number;
  11. volatile int first_pile_price=0;
  12. volatile int second_pile_price=0;
  13. volatile int third_pile_price=0;
  14. int flg_frf;
  15. volatile int i,j,n,kk=1;
  16. volatile int p1,p2,p3;
  17. int jkl;
  18. int total_pile_price[100];
  19.  
  20. //--------
  21. const int a_data[7][2] = {
  22. {9, 15},
  23. {12, 16},
  24. {16, 13},
  25. {18, 13},
  26. {31, 11},
  27. {32, 1},
  28. {36, 9} };
  29. //----
  30.  
  31.  
  32. if(flg_frf==0)
  33. {
  34. flg_frf=1;
  35.  
  36.  
  37. for(i=0;i<numb_stones-numb_piles+1;i++)
  38. {
  39.  
  40. 	for(j=i+1;j<numb_stones-numb_piles+2;j++)
  41. 	{
  42. 		for(n=j+1+1;n<numb_stones-numb_piles+3;n++)
  43. 		{
  44. 			third_pile_price += a_data[n][1];
  45. 		}
  46. 		///obrabotka na informaciqta
  47. 			total_pile_price[kk] = third_pile_price + second_pile_price + first_pile_price;
  48. x  = total_pile_price[kk];
  49. printf("%d\n", x);
  50.  
  51. 			if(total_pile_price[kk]<total_pile_price[kk-1])
  52. {
  53.  
  54. 				p1 = i;
  55. 				p2 = j;
  56. 				p3 = j+1;
  57. 			}
  58. 			kk++;
  59. 		///
  60.  
  61.  
  62.  
  63. 		third_pile_price = 0;
  64. 		second_pile_price += a_data[j][1];
  65. 	}
  66. 	second_pile_price = 0;
  67. 	first_pile_price += a_data[i][1];
  68.  
  69. }
  70.  
  71.  
  72.  
  73. }
  74.  
  75.  
  76.  
  77. 	return 0;
  78. }
Success #stdin #stdout 0s 9432KB
comments (?)
stdin
copy 
1
2
10
42
11
stdout
copy 
1
2
10
34
37
39
51
53
36
38
50
52
41
53
55
53
55
57
https://ideone.com/im9mxw
language:
C (gcc 8.3)
created:
8 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!