aboutsummaryrefslogtreecommitdiff
path: root/codechef/chefAndIpcCertificates
diff options
context:
space:
mode:
authorOmar Magdy <omar.professional8777@gmail.com>2022-05-30 00:18:17 +0200
committerOmar Magdy <omar.professional8777@gmail.com>2022-05-30 00:18:17 +0200
commit3a89fc707253f75f46fd5a4822817f1fd5156c40 (patch)
tree474b08b187895af91c10838aae21142b2ba2514d /codechef/chefAndIpcCertificates
parentf5ff62a26052f084b6b807cba220c86785fd45e3 (diff)
downloadcompetitive-programming-3a89fc707253f75f46fd5a4822817f1fd5156c40.tar.xz
competitive-programming-3a89fc707253f75f46fd5a4822817f1fd5156c40.zip
Made that every problem is its own folder to make building the code a smooth operation with a shortcut
Diffstat (limited to 'codechef/chefAndIpcCertificates')
-rw-r--r--codechef/chefAndIpcCertificates/chefAndIpcCertificates.cpp22
1 files changed, 22 insertions, 0 deletions
diff --git a/codechef/chefAndIpcCertificates/chefAndIpcCertificates.cpp b/codechef/chefAndIpcCertificates/chefAndIpcCertificates.cpp
new file mode 100644
index 0000000..03e93c7
--- /dev/null
+++ b/codechef/chefAndIpcCertificates/chefAndIpcCertificates.cpp
@@ -0,0 +1,22 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+int main() {
+ ios_base::sync_with_stdio(false);
+ cin.tie(NULL);
+ int n, m, k;
+ cin >> n >> m >> k;
+ int ans = 0;
+ for (int i = 0; i < n; i++) {
+ vector<int> v(k);
+ for (int &x : v)
+ cin >> x;
+ int q;
+ cin >> q;
+ if (accumulate(v.begin(), v.end(), 0) >= m && q <= 10) {
+ ans++;
+ }
+ }
+ cout << ans << '\n';
+}