#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
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";
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
380 KB |
Output is correct |
2 |
Correct |
2 ms |
376 KB |
Output is correct |
3 |
Correct |
2 ms |
256 KB |
Output is correct |
4 |
Correct |
2 ms |
256 KB |
Output is correct |
5 |
Correct |
2 ms |
256 KB |
Output is correct |
6 |
Correct |
2 ms |
376 KB |
Output is correct |
7 |
Correct |
2 ms |
256 KB |
Output is correct |
8 |
Correct |
2 ms |
256 KB |
Output is correct |
9 |
Correct |
2 ms |
256 KB |
Output is correct |
10 |
Correct |
2 ms |
256 KB |
Output is correct |