제출 #1170489

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1170489		tamzid	Nadan (COCI18_nadan)	C++20	50 / 50	0 ms	328 KiB

nadan

#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using ll = long long;
#define pb push_back
#define F first
#define S second
#define vii vector<int>
#define vl vector<long long>
#define cinv(v)  for (auto &it : v) cin >> it;
#define coutv(v) for (auto &it : v) cout<<it<<" ";cout<<endl;
using namespace std;
using namespace __gnu_pbds;
template<class T> using ordset=tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;

void solve()
{
    int k,n;
    cin>>k>>n;
    int i = 0;
    int sum = 0;
    for(i=0;i<n-1;++i)
    {
        cout<<i+1<<'\n';
        sum+=(i+1);
    }
    cout<<k-sum<<'\n';
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    //int t;cin>>t;while(t--)
        solve();

    return 0;
}

• Subtask 1: 50 / 50