Add solution for problem B - Coloring

Link: https://codeforces.com/contest/1774/problem/B
Tags: constructive algorithms, greedy, math, *1500
Ref: https://codeforces.com/contest/1774/submission/232666220

Author: MishkatIT

README.md

@@ -13,6 +13,7 @@ A repository to keep track of problem solving practice, containing solutions fro
 
 | # | Title | Solution | Tags | Submitted |
 |---| ----- | -------- | ---- | --------- |
+1102 | [B - Coloring](https://codeforces.com/contest/1774/problem/B) | [GNU C++20 (64)](https://github.com/MishkatIT/codeforces-atcoder-submissions/blob/main/codeforces/1774/1774B%20Coloring.cpp "GNU C++20 (64)") | `constructive algorithms` `greedy` `math` `*1500` | Nov/13/2023 23:46 | 
 1101 | [C - Sum on Subarrays](https://codeforces.com/contest/1809/problem/C) | [GNU C++20 (64)](https://github.com/MishkatIT/codeforces-atcoder-submissions/blob/main/codeforces/1809/1809C%20Sum%20on%20Subarrays.cpp "GNU C++20 (64)") | `constructive algorithms` `greedy` `math` `*1500` | Nov/13/2023 00:34 | 
 1100 | [E - Price Maximization](https://codeforces.com/contest/1690/problem/E) | [GNU C++20 (64)](https://github.com/MishkatIT/codeforces-atcoder-submissions/blob/main/codeforces/1690/1690E%20Price%20Maximization.cpp "GNU C++20 (64)") | `binary search` `greedy` `math` `two pointers` `*1500` | Nov/12/2023 19:11 | 
 1099 | [E - Data Structures Fan](https://codeforces.com/contest/1872/problem/E) | [GNU C++20 (64)](https://github.com/MishkatIT/codeforces-atcoder-submissions/blob/main/codeforces/1872/1872E%20Data%20Structures%20Fan.cpp "GNU C++20 (64)") | `binary search` `bitmasks` `data structures` `dp` `*1500` | Nov/11/2023 21:10 | 

codeforces/1774/1774B Coloring.cpp

@@ -0,0 +1,52 @@
+/*
+    author    : MishkatIT
+    created   : Monday 2023-11-13-17.46.30
+*/
+
+#include<bits/stdc++.h>
+#define fio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
+#define debug(_) cout << #_ << " is " << _ << '\n';
+
+using namespace std;
+using ll        = long long;
+using ld        = long double;
+const ll mod    = 1e9 + 7;
+const ll N      = 2e5 + 10;
+const ll inf    = 1e9;
+const ll linf   = 1e18;
+
+int main()
+{
+    fio;
+    int t;
+    cin >> t;
+    while (t--) {
+        ll n, m, k;
+        cin >> n >> m >> k;
+        vector<ll> v(m);
+        for (auto& i : v) {
+            cin >> i;
+        }
+        ll req = (n + k - 1) / k;
+        int cnt = 0;
+        ll mx = -1;
+        for (int i = 0; i < m; i++) {
+            cnt += (v[i] == req);
+            mx = max(mx, v[i]);
+        }
+        bool ok = true;
+        if (n % k == 0) {
+            if (mx > req) {
+                ok = false;
+            }
+        } else {
+            if (cnt > (n % k) || mx > req) {
+                ok = false;
+            }
+        }
+        cout << (ok ? "YES" : "NO") << '\n';
+    }
+    return 0;
+}
+
+

submissions.json

@@ -21853,5 +21853,23 @@
       "*1500"
     ],
     "timestamp": "Nov/13/2023 00:34"
+  },
+  "CF232666220": {
+    "contest_id": 1774,
+    "language": "GNU C++20 (64)",
+    "path": "codeforces\\1774\\1774B Coloring.cpp",
+    "platform": "Codeforces",
+    "problem_index": "B",
+    "problem_name": "Coloring",
+    "problem_url": "https://codeforces.com/contest/1774/problem/B",
+    "submission_id": "CF232666220",
+    "submission_url": "https://codeforces.com/contest/1774/submission/232666220",
+    "tags": [
+      "constructive algorithms",
+      "greedy",
+      "math",
+      "*1500"
+    ],
+    "timestamp": "Nov/13/2023 23:46"
   }
 }