# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
81689 | aminra | Nadan (COCI18_nadan) | C++14 | 2 ms | 532 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;
typedef long long ll;
const int MOD = 1e9 + 7;
const int MAXN = (int)107;
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";
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |