# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1248780 | bonic | Nadan (COCI18_nadan) | C++20 | 1 ms | 328 KiB |
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int n, m; cin >> n >> m;
vector<int> A(m);
int sum = m*(m+1)/2;
int cnt = n - sum;
for (int i = 0; i < m; i++) {
A[i] = i + 1;
n -= i + 1;
}
int x = cnt / m; int y = cnt % m;
for (int i = 0; i < m; i++) {
A[i] += x;
}
for (int i = m - 1; y > 0; i--, y--) {
A[i]++;
}
for (int i = 0; i < m; i++) {
cout << A[i];
if (i != m - 1) {
cout << "\n";
}
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |