Advertisement
theo830

problem

May 27th, 2019
127
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.46 KB | None | 0 0
  1. while(d != b && uio==1){
  2. if(c < 1000000){
  3. u1 = 1000000000;
  4. u2 = 0;
  5. if(d < b){
  6. c++;
  7. x[e1]++;
  8. y[e1]++;
  9. z[e1]++;
  10. w1[e1]+=3;
  11. d-=q[e1];
  12. q[e1] = x[e1] * y[e1] * z[e1];
  13. d+=q[e1];
  14. if(d == b){
  15. break;
  16. }
  17. for(int i=0;i<a;i++){
  18. if(q[i] < u1){
  19. e1 = i;
  20. u1=q[i];
  21. }
  22. if(q[i] > u2 && m[i] != 1){
  23. e2 = i;
  24. u2 = q[i];
  25. }
  26. }
  27. }
  28. if(d > b){
  29. c++;
  30. if(x[e2] != 1 && y[e2] != 1 && z[e2] != 1){
  31. x[e2]--;
  32. y[e2]--;
  33. z[e2]--;
  34. w1[e2]-=3;
  35. d-=q[e2];
  36. q[e2] = x[e2] * y[e2] * z[e2];
  37. d+=q[e2];
  38. if(d == b){
  39. break;
  40. }
  41. }
  42. else{
  43. m[e2] = 1;
  44. }
  45. for(int i=0;i<a;i++){
  46. if(q[i] < u1){
  47. e1 = i;
  48. u1=q[i];
  49. }
  50. if(q[i] > u2 && m[i] != 1){
  51. e2 = i;
  52. u2 = q[i];
  53. }
  54. }
  55. }
  56. }
  57. else{
  58. uio=0;
  59. }
  60. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement