# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
532774 | GioChkhaidze | Nadan (COCI18_nadan) | C++17 | 1 ms | 332 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>
#define lf (h << 1)
#define mf ((l + r) >> 1)
#define rf ((h << 1) | 1)
#define tree int h, int l, int r
#define left lf, l, mf
#define right rf, mf + 1, r
#define ll long long
#define pb push_back
#define f first
#define s second
using namespace std;
main () {
ios::sync_with_stdio(false);
cin.tie(NULL), cout.tie(NULL);
long long n, k;
cin >> k;
cin >> n;
for (int i = 1; i < n; ++i) {
cout << i << "\n";
}
cout << k - (n * (n - 1)) / 2;;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |