Merge pull request #7 from Modernbeast02/main

#Solutions To Rising Coder Challenge

Author: Ishwarendra

RisingCodersChallenge_v1/A_ParityOfSum.cpp

@@ -1,17 +1,27 @@
 #include <bits/stdc++.h>
 using namespace std;
+#define ll long long int
+#define endl '\n'
 
-int* a;
-
+void solve()
+{
+    ll a, b, c;
+    cin >> a >> b >> c;
+    ll rem = (a + b + c) % 2;
+    if (rem)
+    {
+        cout << "ODD\n";
+        return;
+    }
+    cout << "EVEN\n";
+}
 int main()
 {
-    int n;
-    cin >> n;
-
-    a = new int[n];
-
-    for (int i = 0; i < 10; i++)
-        a[i] = i + 1;
-    for (int i = 0; i < 10; i++)
-        cout << a[i] << " \n";
+    ios_base::sync_with_stdio(false);
+    cin.tie(NULL);
+    int t = 1;
+    // cin >> t;
+    while (t--)
+        solve();
+    return 0;
 }

RisingCodersChallenge_v1/A_ParityOfSum.py

@@ -0,0 +1,33 @@
+#include <bits/stdc++.h>
+using namespace std;
+#define ll long long int
+#define endl '\n'
+
+void solve()
+{
+    set<string> s;
+    s.insert("ACM");
+    s.insert("AMC");
+    s.insert("CAM");
+    s.insert("CMA");
+    s.insert("MCA");
+    s.insert("MAC");
+    string st;
+    cin >> st;
+    if (s.find(st) != s.end())
+    {
+        cout << "ACM\n";
+        return;
+    }
+    cout << "NOPE\n";
+}
+int main()
+{
+    ios_base::sync_with_stdio(false);
+    cin.tie(NULL);
+    int t = 1;
+    cin >> t;
+    while (t--)
+        solve();
+    return 0;
+}

RisingCodersChallenge_v1/B_IsItACM.cpp

@@ -1,33 +1,37 @@
 #include <bits/stdc++.h>
-
 using namespace std;
+#define ll long long int
+#define endl '\n'
 
 void solve()
 {
-    int n, m;
+    ll n, m;
     cin >> n >> m;
-
-    vector<int> alice(m), bob(m);
+    vector<ll> alice(m), bob(m);
     for (int i = 0; i < m; i++)
+    {
         cin >> alice[i];
+    }
     for (int i = 0; i < m; i++)
+    {
         cin >> bob[i];
-
-    int score = 0;
-    for (int i = 0; i < m; i++)
-        score += alice[i] - bob[i];
-
-    if (score + n - m > 0)
+    }
+    ll aliceSum = accumulate(alice.begin(), alice.end(), 0LL);
+    ll bobSum = accumulate(bob.begin(), bob.end(), 0LL);
+    if (aliceSum + n - m > bobSum)
+    {
         cout << "YES\n";
-    else
-        cout << "NO\n";
-}   
-    
+        return;
+    }
+    cout << "NO\n";
+}
 int main()
 {
-    int t;
+    ios_base::sync_with_stdio(false);
+    cin.tie(NULL);
+    int t = 1;
     cin >> t;
-
-    for (int i = 0; i < t; i++)
+    while (t--)
         solve();
+    return 0;
 }

RisingCodersChallenge_v1/B_IsItACM.py

@@ -0,0 +1,45 @@
+#include <bits/stdc++.h>
+using namespace std;
+#define ll long long int
+#define endl '\n'
+
+void solve()
+{
+    string s, y;
+    cin >> s >> y;
+    ll k;
+    cin >> k;
+    map<char, char> mpp;
+    for (int i = 0; i < k; i++)
+    {
+        char a, b;
+        cin >> a >> b;
+        mpp[a] = b;
+        mpp[b] = a;
+    }
+    ll n = s.size();
+    for (int i = 0; i < n; i++)
+    {
+        if (s[i] == y[i])
+        {
+            continue;
+        }
+        if (mpp[s[i]] == y[i])
+        {
+            continue;
+        }
+        cout << "NO\n";
+        return;
+    }
+    cout << "YES\n";
+}
+int main()
+{
+    ios_base::sync_with_stdio(false);
+    cin.tie(NULL);
+    int t = 1;
+    cin >> t;
+    while (t--)
+        solve();
+    return 0;
+}

RisingCodersChallenge_v1/C_FootballFantasy.cpp

@@ -1,32 +1,37 @@
 #include <bits/stdc++.h>
 using namespace std;
+#define ll long long int
+#define endl '\n'
 
-int main()
+void solve()
 {
-    int n;
+    ll n;
     cin >> n;
-
-    std::vector<std::vector<int>> phones(n);
+    vector<pair<ll, ll>> v(n);
     for (int i = 0; i < n; i++)
     {
-        int price, value;
-        cin >> price >> value;
-        phones[i] = {price, value};
+        cin >> v[i].first >> v[i].second;
     }
-
-    sort(phones.begin(), phones.end());
-    for (int i = 0; i < n - 1; i++)
+    sort(v.begin(), v.end());
+    ll mini = v[0].second;
+    for (int i = 1; i < n; i++)
     {
-        // (i, i + 1) compare ho raha hai
-        // i = n - 1 hua toh i + 1 = n ho jaayega 
-        // index out of bound
-        if (phones[i][0] < phones[i + 1][0]
-            and phones[i][1] > phones[i + 1][1])
+        if (v[i].second < mini)
         {
-            cout << "NEW PHONE";
-            return 0;
+            cout << "NEW PHONE\n";
+            return;
         }
+        mini = max(mini, v[i].second);
     }
-
-    cout << "OLD IT IS";
+    cout << "OLD IT IS\n";
+}
+int main()
+{
+    ios_base::sync_with_stdio(false);
+    cin.tie(NULL);
+    int t = 1;
+    // cin >> t;
+    while (t--)
+        solve();
+    return 0;
 }