diff options
| author | Omar Magdy <omar.professional8777@gmail.com> | 2022-05-29 20:33:03 +0200 |
|---|---|---|
| committer | Omar Magdy <omar.professional8777@gmail.com> | 2022-05-29 20:33:03 +0200 |
| commit | 31e018dfd43b92f074951b6bcac510be61895ead (patch) | |
| tree | 162938b751529c8a463a915ebd8f22309dcc2679 | |
| parent | d7873646d445cbbb2b710543345652ddcdfa650c (diff) | |
| download | competitive-programming-31e018dfd43b92f074951b6bcac510be61895ead.tar.xz competitive-programming-31e018dfd43b92f074951b6bcac510be61895ead.zip | |
Solved A subtask problem on codechef
| -rw-r--r-- | codechef/aSubtaskProblem.cpp | 32 |
1 files changed, 32 insertions, 0 deletions
diff --git a/codechef/aSubtaskProblem.cpp b/codechef/aSubtaskProblem.cpp new file mode 100644 index 0000000..b44ed41 --- /dev/null +++ b/codechef/aSubtaskProblem.cpp @@ -0,0 +1,32 @@ +#include <bits/stdc++.h> + +using namespace std; + +int main() { + ios_base::sync_with_stdio(false); + cin.tie(NULL); + int tt; + cin >> tt; + while (tt--) { + int n, m, k; + cin >> n >> m >> k; + vector<int> v(n); + for(int &x : v) cin >> x; + int count = 0; + bool ok = false; + for (int i = 0; i < v.size(); i++) { + if(v[i] == 0 && i <= m - 1) { + ok = true; + } + if (v[i] == 1) + count++; + } + if(count == n) { + cout << 100 << '\n'; + } else if(!ok) { + cout << k << '\n'; + } else { + cout << 0 << '\n'; + } + } +} |
