제출 #684065

#제출 시각아이디문제언어결과실행 시간메모리
684065stevancvNadan (COCI18_nadan)C++14
15 / 50
3 ms328 KiB
#include <bits/stdc++.h> #define ll long long #define ld long double #define sp ' ' #define en '\n' #define smin(a, b) a = min(a, b) #define smax(a, b) a = max(a, b) using namespace std; const int N = 1e6 + 2; const int inf = 1e9; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int k, n; cin >> k >> n; vector<int> ans; for (int i = 1; i <= n; i++) { ans.push_back(i); k -= i; } while (k > 0) { for (int i = n - 1; i >= 0 && k > 0; i--) { ans[i]++; k--; } } for (int i : ans) cout << i << en; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...