diff options
| author | omagdy7 <omar.professional8777@gmail.com> | 2022-11-05 01:28:02 +0200 |
|---|---|---|
| committer | omagdy7 <omar.professional8777@gmail.com> | 2022-11-05 01:28:02 +0200 |
| commit | c52b36c6a37fdb1d1de146d3939cb42e2c691f44 (patch) | |
| tree | b13bbc546bf9505c875dde5d26424d39d23054c9 /codeforces/LisaWorkbook | |
| parent | b79a55ceee2f4532ef6621f9d86c6c61543ce6c9 (diff) | |
| download | competitive-programming-c52b36c6a37fdb1d1de146d3939cb42e2c691f44.tar.xz competitive-programming-c52b36c6a37fdb1d1de146d3939cb42e2c691f44.zip | |
Solved 6 problem in filtrationContest and restructured the repo
Diffstat (limited to 'codeforces/LisaWorkbook')
| -rw-r--r-- | codeforces/LisaWorkbook/LisaWorkbook.cpp | 25 |
1 files changed, 25 insertions, 0 deletions
diff --git a/codeforces/LisaWorkbook/LisaWorkbook.cpp b/codeforces/LisaWorkbook/LisaWorkbook.cpp new file mode 100644 index 0000000..6d8532c --- /dev/null +++ b/codeforces/LisaWorkbook/LisaWorkbook.cpp @@ -0,0 +1,25 @@ +#include <bits/stdc++.h> + +using namespace std; + +int main() +{ + int n, k; + cin >> n >> k; + int pg = 1, res = 0; + for (int i = 0; i < n; i++) { + int np; + cin >> np; + for (int j = 1; j <= np ; j++) { + if (j == pg) { + res++; + } + if (j % k == 0 && j < np) { + pg++; + } + } + pg++; + } + cout << res << endl; + return 0; +} |
