solve for learn

Author: AliBinary

problemset/1328A.cpp

@@ -0,0 +1,22 @@
+/*
+    author:  Ali
+    Email: AliGhanbariCs@gmail.com
+    GitHub: https://github.com/AliBinary
+    created: 28.01.2024 14:49:02
+*/
+
+#include <bits/stdc++.h>
+using namespace std;
+
+int main()
+{
+    int t;
+    cin >> t;
+    while (t--)
+    {
+        long long a, b;
+        cin >> a >> b;
+        long long ans = abs((ceil(a * 1. / b) * b) - a);
+        cout << ans << endl;
+    }
+}

problemset/450A.cpp

@@ -0,0 +1,45 @@
+/*
+    author:  Ali
+    Email: AliGhanbariCs@gmail.com
+    GitHub: https://github.com/AliBinary
+    created: 28.01.2024 19:24:14
+*/
+
+#include <iostream>
+using namespace std;
+
+int main()
+{
+    int n, m;
+    cin >> n >> m;
+    int a[n];
+    for (int i = 0; i < n; i++)
+    {
+        cin >> a[i];
+    }
+    int last;
+    while (1)
+    {
+        bool flag = true;
+        for (int i = 0; i < n; i++)
+        {
+            if (a[i] == 0)
+                continue;
+            else if (a[i] <= m)
+            {
+                a[i] = 0;
+                last = i;
+                flag = false;
+            }
+            else
+            {
+                a[i] -= m;
+                last = i;
+                flag = false;
+            }
+        }
+        if (flag)
+            break;
+    }
+    cout << last + 1;
+}

problemset/456A.cpp

@@ -0,0 +1,57 @@
+/*
+    author:  Ali
+    Email: AliGhanbariCs@gmail.com
+    GitHub: https://github.com/AliBinary
+    created: 28.01.2024 19:01:38
+*/
+
+#include <bits/stdc++.h>
+using namespace std;
+
+struct laptop
+{
+    int x;
+    int y;
+};
+
+bool compare(laptop i1, laptop i2)
+{
+    return (i1.x < i2.x);
+}
+
+int main()
+{
+    int n;
+    cin >> n;
+    vector<laptop> vec(n);
+
+    for (int i = 0; i < n; i++)
+    {
+        int a, b;
+        cin >> a >> b;
+        vec[i].x = a;
+        vec[i].y = b;
+    }
+    sort(vec.begin(), vec.end(), compare);
+
+    cout << endl;
+    for (int i = 0; i < n; i++)
+    {
+        cout << vec[i].x << " " << vec[i].y << endl;
+    }
+
+    bool ans = true;
+    for (int i = 1; i < n; i++)
+    {
+        if (vec[i - 1].y > vec[i].y)
+        {
+            ans = false;
+            break;
+        }
+    }
+
+    if (ans)
+        cout << "Poor Alex";
+    else
+        cout << "Happy Alex";
+}

problemset/469A.cpp

@@ -0,0 +1,54 @@
+/*
+    author:  Ali
+    Email: AliGhanbariCs@gmail.com
+    GitHub: https://github.com/AliBinary
+    created: 28.01.2024 16:01:27
+*/
+
+#include <iostream>
+using namespace std;
+
+int main()
+{
+    int n, k = 0;
+    cin >> n;
+    int p1, p2, P[2 * n] = {};
+    cin >> p1;
+    for (int i = 0; i < p1; i++)
+    {
+        int x;
+        cin >> x;
+        P[k++] = x;
+    }
+    cin >> p2;
+    for (int i = 0; i < p2; i++)
+    {
+        int x;
+        cin >> x;
+        P[k++] = x;
+    }
+
+    bool ans = true;
+    for (int i = 1; i <= n; i++)
+    {
+        bool flag = true;
+        for (int j = 0; j < k; j++)
+        {
+            if (i == P[j])
+            {
+                flag = false;
+                break;
+            }
+        }
+        if (flag)
+        {
+            ans = false;
+            break;
+        }
+    }
+
+    if (ans)
+        cout << "I become the guy." << '\n';
+    else
+        cout << "Oh, my keyboard!";
+}

problemset/479A.cpp

@@ -0,0 +1,25 @@
+/*
+    author:  Ali
+    Email: AliGhanbariCs@gmail.com
+    GitHub: https://github.com/AliBinary
+    created: 28.01.2024 17:06:59
+*/
+
+#include <iostream>
+using namespace std;
+
+int main()
+{
+    int a, b, c;
+    cin >> a >> b >> c;
+
+    int l1 = a * b * c,
+        l2 = a + b + c,
+        l3 = (a + b) * c,
+        l4 = a * (b + c);
+
+    l3 = max(l4, l3);
+    l2 = max(l2, l3);
+    l1 = max(l1, l2);
+    cout << l1;
+}

problemset/520B.cpp

@@ -0,0 +1,37 @@
+/*
+    author:  Ali
+    Email: AliGhanbariCs@gmail.com
+    GitHub: https://github.com/AliBinary
+    created: 28.01.2024 21:15:19
+*/
+
+#include <iostream>
+#include <math.h>
+using namespace std;
+
+int main()
+{
+    int n, m, ans;
+    cin >> n >> m;
+    if (n == m)
+        ans = 0;
+    else if (n > m)
+        ans = n - m;
+    else
+    {
+        ans = 0;
+        while (n < m)
+        {
+            n *= 2;
+            ans++;
+        }
+        for (int i = ans; i >= 0; i--)
+        {
+            int dis = n - m;
+            int kam = (dis / int(pow(2, i)));
+            ans += kam;
+            n -= kam * pow(2, i);
+        }
+    }
+    cout << ans;
+}