#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector <ll> v;
vector <ll> v1;
vector <ll> v2;
int main()
{
ll k,n;
cin>>k>>n;
ll a[n]={0};
ll sum=0;
for(int i=0;i<n;i++)
{
if(i==n-1)
a[i]=k-sum;
else
{
a[i]=i+1;
sum+=i+1;
}
}
for(int i=0;i<n;i++)
cout<<a[i]<<endl;
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
0 ms |
212 KB |
Output is correct |
4 |
Correct |
0 ms |
300 KB |
Output is correct |
5 |
Correct |
1 ms |
212 KB |
Output is correct |
6 |
Correct |
1 ms |
300 KB |
Output is correct |
7 |
Correct |
1 ms |
300 KB |
Output is correct |
8 |
Correct |
0 ms |
212 KB |
Output is correct |
9 |
Correct |
1 ms |
212 KB |
Output is correct |
10 |
Correct |
0 ms |
212 KB |
Output is correct |