# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
305096 | phathnv | Nadan (COCI18_nadan) | C++11 | 1 ms | 384 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 mp make_pair
#define X first
#define Y second
using namespace std;
typedef long long ll;
typedef pair <int, int> ii;
int k, n;
void readInput(){
scanf("%d %d", &k, &n);
}
void solve(){
for(int i = 1; i < n; i++){
printf("%d\n", i);
k -= i;
}
printf("%d\n", k);
}
int main(){
readInput();
solve();
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |