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
|
#include<iostream>
#include<vector>
#include<cstring>
#include<queue>
#include<stack>
#include<algorithm>
#include<string>
#include<cmath>
#include<functional>
using namespace std;
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define INF 987654321
#define LINF 321321321321
#define MAX 1000100
ll A[MAX];
ll N, B, C;
ll ret = 0;
int main(void) {
memset(A, LINF, sizeof(A));
cin >> N;
for (int i = 1; i <= N; i++) {
cin >> A[i];
}
cin >>B>> C;
for (int i = 1; i <= N; i++) {
A[i] -= B;
ret++;
}
for (int i = 1; i <= N; i++) {
if (A[i] > 0) {
ll tmp = A[i] % C;
//cout << tmp<<"tmp \n";
ll quot=0;
if (tmp > 0) quot = A[i] / C + 1;
else if(tmp==0) quot = A[i] / C;
ret += quot;
}
}
cout << ret;
return 0;
}
|
cs |
방의개수* 응시자수 최대값이 int형 범위를 넘어서는 경우 조심.