Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- /*
- 3
- Melynas 9 P B L D B P L P B
- Raudonas 15 D B D B D B D L D B D B D B L
- Sviesiai zalias 1 P
- */
- #include <iostream>
- #include <iomanip>
- #include <fstream>
- using namespace std;
- const char duomF[] = "1.txt";
- const char rezF[] = "rez1.txt";
- const int CMax = 101;
- const int CPav = 20;
- struct piestukai
- {
- string pav;
- double ilgis;
- char raide;
- };
- void reset(piestukai A[])
- {
- for (int i = 0; i < CMax; i++)
- {
- A[i].ilgis = 150;
- }
- }
- void skaitymas(piestukai A[], int &n)
- {
- ifstream df(duomF);
- char eil[CPav + 1];
- char temp;
- int p;
- df >> n;
- for (int i = 0; i < n; i++)
- {
- df.ignore(80, '\n');
- df.get(eil, CPav);
- A[i].pav = eil;
- df >> p;
- for (int j = 0; j < p; j++)
- {
- df >> temp;
- A[j].raide = temp;
- if (A[j].raide == 'P') A[i].ilgis -= 10;
- else if (A[j].raide == 'D') A[i].ilgis -= 7;
- else if (A[j]. raide == 'B')
- {
- if (A[j-1].raide == 'P') A[i].ilgis -= 7;
- else if (A[j-1].raide == 'D') A[i].ilgis -= 5;
- }
- }
- }
- df.close();
- }
- int main ()
- {
- piestukai A[CMax];
- int n;
- reset(A);
- skaitymas(A, n);
- for(int i = 0; i < n; i++) cout << A[i].pav << A[i].ilgis << endl;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement