#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n,m,sum,ans,t,a,b,c,q;
string s,ss;
const ll N = 1000000;
//map<ll,ll>mp;
//map<char,ll>mp2;
//vector<ll>v;
//set<int>st;
int main()
{
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin>>m>>n;
if(n==1) cout<<m<<endl;
else
{ for (int i = 1 ; i <= n; i++)
{
if (i!= n) {cout<<i<<endl; m-=i;}
else cout<<m<<endl;
}}
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
0 ms |
212 KB |
Output is correct |
5 |
Correct |
0 ms |
212 KB |
Output is correct |
6 |
Correct |
0 ms |
212 KB |
Output is correct |
7 |
Correct |
1 ms |
316 KB |
Output is correct |
8 |
Correct |
1 ms |
212 KB |
Output is correct |
9 |
Correct |
1 ms |
316 KB |
Output is correct |
10 |
Correct |
1 ms |
212 KB |
Output is correct |