# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
684065 |
2023-01-20T08:35:44 Z |
stevancv |
Nadan (COCI18_nadan) |
C++14 |
|
3 ms |
328 KB |
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define sp ' '
#define en '\n'
#define smin(a, b) a = min(a, b)
#define smax(a, b) a = max(a, b)
using namespace std;
const int N = 1e6 + 2;
const int inf = 1e9;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int k, n;
cin >> k >> n;
vector<int> ans;
for (int i = 1; i <= n; i++) {
ans.push_back(i);
k -= i;
}
while (k > 0) {
for (int i = n - 1; i >= 0 && k > 0; i--) {
ans[i]++;
k--;
}
}
for (int i : ans) cout << i << en;
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
2 |
Incorrect |
0 ms |
328 KB |
Output isn't correct |
3 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Incorrect |
1 ms |
320 KB |
Output isn't correct |
6 |
Incorrect |
1 ms |
324 KB |
Output isn't correct |
7 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
8 |
Correct |
1 ms |
212 KB |
Output is correct |
9 |
Correct |
0 ms |
212 KB |
Output is correct |
10 |
Incorrect |
3 ms |
212 KB |
Output isn't correct |