제출 #158732

#제출 시각아이디문제언어결과실행 시간메모리
158732InfiniteJestNadan (COCI18_nadan)C++14
50 / 50
2 ms376 KiB
#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <algorithm>
#include <math.h>
#include <map>
#include <set>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;

ifstream in("input.txt");
ofstream out("output.txt");

typedef long long ll;

int n,k;

int main(){
  cin>>k>>n;
  int tot=0;
  for(int i=0;i<n-1;i++){
    cout<<i+1<<endl;
    tot+=i+1;
  }
  cout<<k-tot;


}
#Verdict Execution timeMemoryGrader output
Fetching results...