# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
158732 | InfiniteJest | Nadan (COCI18_nadan) | C++14 | 2 ms | 376 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 <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <algorithm>
#include <math.h>
#include <map>
#include <set>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
ifstream in("input.txt");
ofstream out("output.txt");
typedef long long ll;
int n,k;
int main(){
cin>>k>>n;
int tot=0;
for(int i=0;i<n-1;i++){
cout<<i+1<<endl;
tot+=i+1;
}
cout<<k-tot;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |