forked from ngthanhtrung23/CompetitiveProgramming
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathC.cpp
More file actions
41 lines (32 loc) · 1.09 KB
/
C.cpp
File metadata and controls
41 lines (32 loc) · 1.09 KB
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
#include <bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a),_b=(b); i<=_b; i++)
#define FORD(i,a,b) for(int i=(a),_b=(b); i>=_b; i--)
#define REP(i,a) for(int i=0,_a=(a); i<_a; i++)
#define EACH(it,a) for(__typeof(a.begin()) it = a.begin(); it != a.end(); ++it)
#define DEBUG(x) { cout << #x << " = "; cout << (x) << endl; }
#define PR(a,n) { cout << #a << " = "; FOR(_,1,n) cout << a[_] << ' '; cout << endl; }
#define PR0(a,n) { cout << #a << " = "; REP(_,n) cout << a[_] << ' '; cout << endl; }
#define sqr(x) ((x) * (x))
using namespace std;
const int MN = 200111;
int n;
long long A, d[MN], sumd;
int main() {
ios :: sync_with_stdio(false);
while (cin >> n >> A) {
sumd = 0;
FOR(i,1,n) {
cin >> d[i];
sumd += d[i];
}
FOR(i,1,n) {
long long nn = n-1;
long long ln = sumd - d[i];
long long lb = max(1LL, A - ln);
long long ub = min(d[i], A - nn);
cout << (d[i] - (ub - lb + 1)) << ' ';
}
cout << endl;
}
return 0;
}