Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <fstream>
- using namespace std;
- struct fuvar{
- int nap;
- int sorszam;
- int tav;
- };
- int ar(int tav)
- {
- if(tav<=2) return 500;
- if(tav<=5) return 700;
- if(tav<=10) return 900;
- if(tav<=20) return 1400;
- return 2000;
- }
- int main(int argc, char **argv)
- {
- fuvar ft[300]; // eleg lenne 280 is
- int napok[8]={0}, tavok[8]={0}; // eleg lenne 7 is
- ifstream be;
- be.open("tavok.txt");
- int db=0;
- while(be >> ft[db].nap >> ft[db].sorszam >> ft[db].tav)
- {
- napok[ft[db].nap]++; // 4. és 5. feladathoz
- tavok[ft[db].nap]+=ft[db].tav; // 6. feladathoz
- db++;
- }
- be.close();
- // rendezés a 2. és 3. feladathoz
- for(int i=0; i<db-1; i++)
- {
- for(int j=0; j<db-i; j++)
- {
- if( (ft[j].nap>ft[j+1].nap) or ((ft[j].nap==ft[j+1].nap) and (ft[j].sorszam>ft[j+1].sorszam)) )
- {
- swap(ft[j], ft[j+1]);
- }
- }
- }
- cout << "F2: " << ft[0].tav << endl;
- cout << "F3: " << ft[db-1].tav << endl;
- cout << "F4: ";
- int maxnap=1;
- for(int i=1; i<=7; i++)
- {
- if(napok[i]==0) { cout << i << " ";}
- if(napok[i]>napok[maxnap]) { maxnap=i; }
- }
- cout << endl;
- cout << "F5: " << maxnap << endl;
- cout << "F6: ";
- for(int i=1; i<=7; i++)
- {
- cout << i << ".nap: " << tavok[i] << " km" << endl;
- }
- cout << "F7: Add meg a tavot! ";
- int tavolsag;
- cin >> tavolsag;
- cout << ar(tavolsag) << endl;
- ofstream ki;
- ki.open("dijazas.txt");
- int osszeg=0;
- for(int i=0; i<db; i++)
- {
- ki << ft[i].nap << ". nap " << ft[i].sorszam << ". ut " << ar(ft[i].tav) << " Ft" << endl;
- osszeg+=ar(ft[i].tav);
- }
- ki.close();
- cout << "F9: " << osszeg << endl;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement