# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
145128 | 2019-08-18T21:13:27 Z | Sarah_Mokhtar | Nadan (COCI18_nadan) | C++14 | 0 ms | 0 KB |
#include <bits/stdc++.h> using namespace std; typedef long long ll; const int N=1e5+20,M=(N<<4),OO=1e9; #define f first #define s second #define pb push_back #define sz size int n,A[N],pos[N],tree[M]; ll n,k; int main(){ cin>>k>>n; ll sum=0; for(int i=0;i<n-1;++i){ cout<<i+1<<"\n"; sum+=i+1; } cout<<k-sum<<"\n"; }