# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
81688 | 2018-10-26T07:47:09 Z | aminra | Nadan (COCI18_nadan) | C++14 | 2 ms | 824 KB |
#include <bits/stdc++.h> using namespace std; typedef long long ll; const int MOD = (int)998244353; const int MAXN = (int)18; const int MAXS = (int)(1 << 18 + 3); const int infint = (int)1e9; const ll inf = (ll)1e18; ll n, k, ans[MAXN]; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> k >> n; for (int i = 1; i <= n; i++) ans[i] = i; ll sum = n * (n + 1) / 2; ans[n] += k - sum; for (int i = 1; i <= n; i++) cout << ans[i] << "\n"; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 380 KB | Output is correct |
3 | Correct | 2 ms | 584 KB | Output is correct |
4 | Correct | 2 ms | 660 KB | Output is correct |
5 | Correct | 2 ms | 660 KB | Output is correct |
6 | Correct | 2 ms | 660 KB | Output is correct |
7 | Correct | 2 ms | 660 KB | Output is correct |
8 | Correct | 2 ms | 660 KB | Output is correct |
9 | Runtime error | 2 ms | 760 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
10 | Runtime error | 2 ms | 824 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |