uj dolgok asszem

quito/10.1.cpp

@@ -0,0 +1,27 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+struct dolgozo {
+    int age, salary;
+};
+
+
+int main() {
+    int n;
+    int max = 0;
+    int index;
+    cin >>n; 
+    vector<dolgozo> v(n);
+    for (int i =0; i<n; i++) {
+        cin >> v[i].age >> v[i].salary;
+        if (v[i].age > max) {
+            max = v[i].age;
+            index = i;
+        }
+    }
+    cout<<v[index].salary;
+
+        
+
+
+}

quito/10.2.cpp

@@ -0,0 +1,26 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+int main() {
+    int sum = 0;
+    int n;
+    cin >> n;
+    vector<int> coins(n);
+    for (int i = 0; i < n; i++) {
+        cin >> coins[i];
+        sum += coins[i];
+        
+    }
+
+    sort(coins.begin(), coins.end());
+    reverse(coins.begin(), coins.end());
+
+    int ammount = 0, out = 0;
+    while (ammount <= sum/2) {
+        ammount += coins[out];
+        out++;
+    }
+    cout<<out;
+
+
+}

quito/10.3.cpp

@@ -0,0 +1,38 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+struct tortek {
+    int szamlalo, nevezo;
+};
+
+tortek egyszerusites(tortek a) {
+    tortek out;
+    if (a.szamlalo != 1 || a.nevezo != 1) {
+        if (a.szamlalo >= a.nevezo) {
+            for (int i = a.nevezo-1; i < 0; i--) {
+                if (i%a.nevezo==0 && i%a.szamlalo==0) {
+                    out.nevezo=a.nevezo/i;
+                    out.szamlalo=a.szamlalo/i;
+                    return out;
+                }
+            }
+        }
+    }
+    return a;
+}
+
+int main () {
+    tortek input;
+    tortek modosito;
+    tortek out;
+
+    cin >> input.szamlalo >> input.nevezo;
+    cin >> modosito.szamlalo >> modosito.nevezo;
+
+
+    // szorzas
+    out.szamlalo = input.szamlalo * modosito.szamlalo;
+    out.nevezo = input.nevezo * modosito.nevezo;
+    cout<<egyszerusites(out).nevezo <<" "<<egyszerusites(out).szamlalo;
+
+}

quito/Kefa.cpp

@@ -0,0 +1,31 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+int main () {
+    int n;
+    cin >> n;
+    vector<int> szamok(n);
+    for (int i = 0; i < n; i++) {
+        cin >> szamok[i];
+    }
+    int streak =1;
+    int maxstreak =0;
+    for (int i = 0; i < n; i++) {
+        if (i != 0) {
+            if (szamok[i-1] <= szamok[i]) {
+                streak++;
+                //cout<<szamok[i-1]<<'<'<<szamok[i]<<endl;
+            } else {
+                if (streak > maxstreak) {
+                    //cout<<"streakreset"<<endl;
+                    maxstreak = streak;
+                    streak= 1;
+                }
+            }
+        }
+    }
+    if (streak > maxstreak) {
+        maxstreak = streak;
+    }
+    cout<<maxstreak;
+}

quito/kagami.cpp

@@ -0,0 +1,21 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+int main () {
+    int n;
+    cin >> n;
+    vector<int>v(n);
+    for (int i = 0; i < n; i++) {
+        cin >> v[i];
+    }
+    sort(v.begin(), v.end());
+    int out =1;
+    for (int i = 0; i < n; i++) {
+        if (i!=0){
+            if (v[i-1] != v[i]) {
+                out++;
+            }
+        }
+    }
+    cout<<out;
+}

quito/matrix.cpp

@@ -0,0 +1,22 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+int main () {
+    int h, w;
+    cin >> h >> w;
+    vector<vector<int>> v(h, vector<int>(w));
+    for (int i = 0; i < h; i++) {
+        for (int j = 0; j < w; j++) {
+            cin >> v[i][j];
+        }
+    }
+    //cout<<endl;
+
+    for (int i = 0; i < w; i++) {
+        for (int j = 0; j < h; j++) {
+            cout << v[j][i]<< " ";
+        }
+        cout<<endl; 
+    }
+
+}

quito/subtractions.cpp

@@ -0,0 +1,28 @@
+
+#include <bits/stdc++.h>
+using namespace std;
+
+int main () {
+    int n;
+    cin >> n;
+    int counter = 0;
+    int elso,masodik;
+    for (int i =0; i< n;i++) {
+        cin >> elso >> masodik;
+        while (elso > 0 || masodik > 0) {
+            if (elso == 0 || masodik == 0) {
+                break;
+            } else if (elso >= masodik) {
+                elso -= masodik;
+                counter++;
+                //cout<<elso<<">"<<masodik<<endl;
+            } else if (elso <= masodik) {
+                masodik -= elso;
+                counter++;
+                //cout<<elso<<"<"<<masodik<<endl;
+            }
+        }
+        cout<<counter<<endl;
+        counter = 0;
+    }
+}

tmep.cpp

@@ -0,0 +1,23 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+struct dolgozo{
+    int nap1, nap2, penz;
+};
+int main() {
+    int osszespenz = 0;
+    int n, m;
+    cin >> n >> m;
+    int max = 0;
+    int out;
+    vector<dolgozo> naposok(n);
+    for (int i = 0; i < n; i++) {
+        cin >> naposok[i].nap1 >> naposok[i].nap2 >> naposok[i].penz;
+        osszespenz += (naposok[i].nap2-naposok[i].nap1+1)*naposok[i].penz;
+        if (naposok[i].nap2-naposok[i].nap1+1) * naposok[i].penz > max) {
+            out = i+1;   
+        } 
+    }
+    cout<<osszespenz<< endl;
+    cout << out;
+}