| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 464606 | Sarah_Mokhtar | Nadan (COCI18_nadan) | C++14 | 0 ms | 0 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;
typedef long long ll;
#define read freopen("in.txt","r",stdin);freopen("out.txt","w",stdout);
#define LESSGO ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
const ll N=1e6+10,M=505,OO=1e16,mod=1e9+7;
int k,n,ans[N]
int main(){
cin>>k>>n;
int cur=1;
for(int i=0;i<n;++i){
ans[i]=cur++;
k-=ans[i];
}
ans[n-1]+=k;
for(int i=0;i<n;++i) cout<<ans[i]<<'\n';
}