Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- using System;
- using System.Collections.Generic;
- using System.Linq;
- using System.Text;
- using System.Threading.Tasks;
- using System.IO;
- namespace cegesauto
- {
- class Program
- {
- struct adat{
- public int nap, az, km, kibe;
- public string oraperc, rsz;
- }
- static adat[] ca = new adat[500];
- static int db = 0;
- static int n = 2;
- static void exn(){
- Console.WriteLine($"{n++}. feladat");
- }
- static void ex1(){
- StreamReader sr = new StreamReader("autok.txt");
- while (!sr.EndOfStream){
- string[] sor = sr.ReadLine().Split(' ');
- ca[db].nap = Convert.ToInt32(sor[0]);
- ca[db].oraperc = sor[1];
- ca[db].rsz = sor[2];
- ca[db].az = Convert.ToInt32(sor[3]);
- ca[db].km = Convert.ToInt32(sor[4]);
- ca[db].kibe = Convert.ToInt32(sor[5]);
- db++;
- }
- sr.Close();
- }
- static void ex2() {
- exn();
- int index = 0;
- for (int i = 0; i < db; i++){
- if (ca[i].kibe==0){
- index = i;
- }
- }
- Console.WriteLine($"{ca[index].nap}. nap rendszám: {ca[index].rsz}");
- }
- static void ex3() {
- exn();
- Console.Write("Nap: ");
- int nap = Convert.ToInt32(Console.ReadLine());
- Console.WriteLine($"Forgalom a(z) {nap}. napon:");
- for (int i = 0; i < db; i++){
- if (nap==ca[i].nap){
- Console.WriteLine(ca[i].oraperc+" "+ ca[i].rsz + " " + ca[i].az + " " + ca[i].kibe);
- }
- }
- }
- static void ex4() {
- exn();
- int sz = 0;
- for (int i = 0; i < db; i++){
- if (ca[i].kibe==0){
- sz++;
- }
- else{
- sz--;
- }
- }
- Console.WriteLine($"A hónap végén {sz} autót nem hoztak vissza.");
- }
- static void ex5() {
- exn();
- int v = 0, k = 0;
- for (int i = 0; i < 10; i++) {
- for (int j = 0; j < db; j++) {
- if (ca[j].rsz == "CEG30" + i) {
- v = ca[j].km;
- }
- }
- for (int j = db - 1; j >= 0; j--) {
- if (ca[j].rsz == "CEG30" + i)
- {
- k = ca[j].km;
- }
- }
- Console.WriteLine($"CEG30{i} {v-k} km");
- }
- }
- static void ex6() {
- exn();
- int kezd = 0, veg = 0, max = 0;
- int[] km = new int[601];
- for (int i = 500; i < 601; i++){
- for (int j = 0; j < db; j++){
- if (ca[j].az==i && ca[j].kibe==0){
- kezd = ca[j].km;
- for (int k = j; k < db; k++){
- if (ca[k].az==i && ca[k].kibe==1){
- veg = ca[k].km;
- break;
- }
- }
- if (km[i]<veg-kezd){
- km[i] = veg-kezd;
- }
- kezd = 0;
- veg = 0;
- }
- }
- }
- for (int i = 0; i < km.Length; i++){
- if (km[max]<km[i]){
- max = i;
- }
- }
- Console.WriteLine($"Leghosszabb út: {km[max]} km, személy: {max}");
- }
- static void Main(string[] args)
- {
- ex1();
- ex2();
- ex3();
- ex4();
- ex5();
- ex6();
- //ex7();
- Console.ReadKey();
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement