# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
253898 | Molukhyyeh | Nadan (COCI18_nadan) | C++14 | 1 ms | 256 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 ll long long
#define all(x) x.begin(),x.end()
int const N = 200001;
int main(){
int n, k;
scanf("%d%d", &k, &n);
int i = 1;
if(k >= (n * (n+1))/2){
while(i < n && k > 0){
printf("%d\n", i++);
k-=i;
}
printf("%d\n", k);
}
else {
for(int j = 0; j<n-1; ++j)printf("1\n");
printf("%d\n", k-(n-1));
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |