| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1206947 | lmaobruh | Nadan (COCI18_nadan) | C++17 | 0 ms | 328 KiB |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fi first
#define se second
#define vi vector<int>
#define fo(i,a,b) for(int i=(a);i<=(b);++i)
#define fd(i,a,b) for(int i=(a);i>=(b);--i)
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define maxi(a,b) a=max(a,b)
#define mini(a,b) a=min(a,b)
#define ii pair<int,int>
const int N = 1e6+5, mod = 1e9+7;
int n, k;
void solve() {
cin >> k >> n;
fo(i,1,n) {
if (i<n) cout << i << '\n', k-=i;
else cout << k << '\n';
}
}
signed main() {
cin.tie(0)->sync_with_stdio(0);
if (fopen("A.inp", "r"))
freopen("A.inp", "r", stdin);
solve();
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
