# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
81855 | BabinSinko | Nadan (COCI18_nadan) | C++14 | 3 ms | 732 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 <cstdio>
#include <cstdlib>
#include <cmath>
#include <iostream>
#include <cctype>
using namespace std;
int k, n, x[103], f, i,j;
int main() {
cin >> k >> n;
f = k;
while (f > 0){
x[i+j] += 1;
f = f-1;
i += 1;
if (i >= n){
i = 0;
j = j + 1;
}
}
for (int i = 0; i < (n-1); i++){
cout << x[i] << endl;
f = f + x[i];
}
cout << k - f;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |