# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1115127 | duytuandao21 | Nadan (COCI18_nadan) | C++17 | 2 ms | 336 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 2e6 + 7;
const int inf = 1e9 + 7;
typedef pair<int, int> pii;
int n, m, k;
int a[N];
signed main()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> k >> m;
if (m == 1) {
cout << k;
}
else {
for (int i = 1; i < m; i++) {
k -= i;
cout << i << '\n';
}
cout << k;
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |