-
Notifications
You must be signed in to change notification settings - Fork 12
/
Copy pathLisa'sWorkbook.cpp
62 lines (48 loc) · 1.18 KB
/
Lisa'sWorkbook.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
/* Enter your code here. Read input from STDIN. Print output to STDOUT */
int n, k;
cin >> n >> k;
vector<int> temp(n);
for(int i = 0; i < n; i++){
cin >> temp[i];
}
int ans = 0, start = 0;
for(int i = 0; i < n; i++){
int pages = temp[i]/k;
if(temp[i]%k){
pages++;
}
int st = start + 1, end = start + pages;
int t = st;
int ques = 0, last = -k;
while(t <= end){
last = ques;
if(t == end){
if(temp[i]%k){
ques += temp[i]%k;
}
else{
ques += k;
}
}
else{
ques += k;
}
for(int j = 0; j < k; j++){
if((ques-j == t) && (ques-j > last)){
ans++;
}
}
t++;
}
start = end;
}
cout << ans << endl;
return 0;
}