Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <cmath>
- #include <iomanip>
- #include <fstream>
- #include <string>
- #include <math.h>
- using namespace std;
- const char duomF[] = "U1.txt";
- const char rezF[] = "U1rez.txt";
- const int CMax = 6;
- void skaitymas(int A[], int &n)
- {
- ifstream df(duomF);
- int temp;
- df >> n;
- for (int i = 0; i < n; i++)
- {
- for (int j = 0; j < 6; j++)
- {
- df >> temp;
- A[j] += temp;
- }
- }
- df.close();
- }
- void reset(int A[])
- {
- for (int i = 0; i < 6; i++)
- {
- A[i] = 0;
- }
- }
- void komplektai(int A[])
- {
- int p, b, z, r, k, v;
- int count = 0;
- p = A[0] / 8; b = A[1] / 2; z = A[2] / 2;
- r = A[3] / 2; k = A[4]; v = A[5];
- while (p >= 1 & b >= 1 & z >= 1 & r >= 1 & k >= 1 & v >= 1)
- {
- if(p >= 1 & b >= 1 & z >= 1 & r >= 1 & k >= 1 & v >= 1)
- {
- count++;
- p -= 1; b -= 1; z -= 1;
- r -= 1; k -= 1; v -= 1;
- }
- }
- ofstream rf(rezF);
- rf << count << endl;
- rf.close();
- }
- int main ()
- {
- // 0 - Pestininkas; 1 - Bokstas; 2 - Zirgas
- // 3 - Rikis; 4 - Karalius; 5 - Valdove;
- int A[CMax]; int n;
- reset(A);
- skaitymas(A, n);
- //for (int i = 0; i < 6; i++) cout << A[i] << endl;
- komplektai(A);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement