# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
931929 | 2024-02-22T15:24:50 Z | hugsfromadicto | Tarifa (COCI16_tarifa) | C++14 | 1 ms | 600 KB |
#pragma GCC optimize("O3") #include <bits/stdc++.h> #define int long long using namespace std; const int mxN = 200; int a[mxN], b[mxN]; int s[mxN]; void _() { int n,x; cin >> x; cin >> n; for(int i = 0; i < n; ++i) cin >> a[i]; int sum = 0; for(int i = 0; i < n; ++i) { sum += (x - a[i]); } cout << sum + x; } main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int tc = 1; while(tc--) { _(); } }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 0 ms | 344 KB | Output is correct |
4 | Correct | 0 ms | 600 KB | Output is correct |
5 | Correct | 1 ms | 344 KB | Output is correct |
6 | Correct | 0 ms | 348 KB | Output is correct |
7 | Correct | 0 ms | 348 KB | Output is correct |
8 | Correct | 0 ms | 348 KB | Output is correct |
9 | Correct | 1 ms | 456 KB | Output is correct |
10 | Correct | 0 ms | 348 KB | Output is correct |