Added 4 problems from Codechef's August Challenge 2021 Division 2

Author: leonardoAnjos16

Codechef/chef_and_bulb_invention.cpp

@@ -0,0 +1,22 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+#define long long long int
+
+int main() {
+    ios_base::sync_with_stdio(false);
+    cin.tie(NULL);
+
+    int T; cin >> T;
+    while (T--) {
+        int N, p, K;
+        cin >> N >> p >> K;
+
+        int ans = (p % K) * (N / K);
+        ans += min(N % K, p % K);
+        ans += p / K + 1;
+
+        cout << ans << "\n";
+    }
+}

Codechef/olympics_ranking.cpp

@@ -0,0 +1,21 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+#define long long long int
+
+int main() {
+    ios_base::sync_with_stdio(false);
+    cin.tie(NULL);
+
+    int T; cin >> T;
+    while (T--) {
+        int G1, S1, B1, G2, S2, B2;
+        cin >> G1 >> S1 >> B1 >> G2 >> S2 >> B2;
+
+        int T1 = G1 + S1 + B1;
+        int T2 = G2 + S2 + B2;
+
+        cout << (T1 > T2 ? "1" : "2") << "\n";
+    }
+}

Codechef/problem_difficulties.cpp

@@ -0,0 +1,24 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+#define long long long int
+
+const int MAX = 15;
+
+int main() {
+    ios_base::sync_with_stdio(false);
+    cin.tie(NULL);
+
+    int T; cin >> T;
+    while (T--) {
+        int cnt[MAX] = {0}, mx = 0;
+        for (int i = 0; i < 4; i++) {
+            int A; cin >> A;
+            mx = max(mx, ++cnt[A]);
+        }
+
+        int ans = mx <= 2 ? 2 : (mx <= 3 ? 1 : 0);
+        cout << ans << "\n";
+    }
+}

Codechef/special_triplets.cpp

@@ -0,0 +1,22 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+#define long long long int
+
+int main() {
+    ios_base::sync_with_stdio(false);
+    cin.tie(NULL);
+
+    int T; cin >> T;
+    while (T--) {
+        int N; cin >> N;
+
+        long ans = 0LL;
+        for (int C = 1; C <= N; C++)
+            for (int B = 2 * C; B <= N; B += C)
+                ans += (N - C) / B + 1;
+
+        cout << ans << "\n";
+    }
+}