Advertisement
MariusPure

IT VBE 2018

Jun 17th, 2019
138
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.37 KB | None | 0 0
  1. #include <iostream>
  2. #include <fstream>
  3. #include <algorithm>
  4. using namespace std;
  5.  
  6. int n = 0;
  7.  
  8. int RED;
  9.  
  10. int GREEN;
  11.  
  12. int YELLOW;
  13.  
  14. char vel[100];
  15. int velX[100];
  16.  
  17. void skaitymas(int& n, int& RED, int& GREEN, int& YELLOW, char vel[], int velX[]);
  18. void skaicaivimas(int n, int& RED, int& GREEN, int &YELLOW, char vel[], int velX[]);
  19.  
  20. int main()
  21. {
  22. skaitymas(n, RED, GREEN, YELLOW, vel, velX);
  23. skaicaivimas(n, RED, GREEN, YELLOW, vel, velX);
  24. }
  25. void skaitymas(int& n, int& RED, int& GREEN, int& YELLOW, char vel[], int velX[])
  26. {
  27. ifstream d("duom.txt");
  28.  
  29. d >> n;
  30. for (int i = 0; i < n; i++)
  31. {
  32. d >> vel[i] >> velX[i];
  33.  
  34. if (vel[i] == 'G') // Jei Simbolis Lygus spalvos pavadinimui, Pridedama Tos Spalvos suma
  35. {
  36. YELLOW += velX[i];
  37. }
  38. if (vel[i] == 'R')// zalia
  39. {
  40. RED += velX[i];
  41. }
  42. if (vel[i] == 'Z')//raudona
  43. {
  44. GREEN += velX[i];
  45. }
  46. }
  47. //cout << YELLOW << GREEN << RED << endl;
  48.  
  49. d.close();
  50. }
  51.  
  52. void skaicaivimas(int n, int &RED, int& GREEN, int& YELLOW, char vel[], int velX[])
  53. {
  54. int flag = 0;
  55. while ((GREEN != 0) && (YELLOW != 0) && (RED != 0)) // salyga vykdoma kol nesibaigia veliaveles
  56. {
  57. YELLOW -= 2; // Atimama po dvi velevles is kiekvienos spalvos;
  58. GREEN -= 2;
  59. RED -= 2;
  60. flag++;
  61. }
  62.  
  63. cout << flag << endl;
  64. cout << "G " << YELLOW << "Z" << GREEN << "R " << RED << endl;
  65. }
  66.  
  67.  
  68.  
  69. //while r || m || z =0
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement