Submission #823782

#TimeUsernameProblemLanguageResultExecution timeMemory
823782ajayNadan (COCI18_nadan)C++14
50 / 50
1 ms320 KiB
/* Ajay Jadhav */ #include <iostream> #include <cstdio> #include <algorithm> #include <deque> #include <vector> #include <cstdlib> #include <iomanip> #include <cmath> #include <queue> #include <map> #include <set> #include <stack> #include <ctime> #include <string.h> #include <climits> #include <cstring> using namespace std; #define ll long long #define pb push_back #define pii pair<int, int> #define vi vector<int> #define vii vector<pii> #define mi map<int, int> #define mii map<pii, int> #define all(a) (a).begin(), (a).end() #define x first #define y second #define sz(x) (int)x.size() #define hell 1000000007 #define rep(i, a, b) for (int i = a; i < b; i++) #define endl '\n' void solve() { int n, k; cin >> k >> n; int cur = 1; vi ans; for (int i = 0; i < n; i++) { if (k >= cur) { ans.pb(cur); k -= cur; cur++; } else { ans.pb(k); } } if (k > 0) { ans[sz(ans) - 1] += k; } rep(i, 0, sz(ans)) { cout << ans[i] << endl; } } signed main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int t = 1; // cin>>t; while (t--) { solve(); } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...