Submission #1213773

#TimeUsernameProblemLanguageResultExecution timeMemory
1213773badge881Nadan (COCI18_nadan)C++20
50 / 50
19 ms23880 KiB
#include <bits/stdc++.h> using namespace std; const int MAXN = 1e6 + 4; const int MOD = 1e9 + 7; vector<int> add[MAXN]; int main() { int k, n; cin >> k >> n; vector<int> v(n + 1); long long sum = 0; for(int i = 1; i <= n; i++){ if(i == n) v[i] = k - sum; else v[i] = i; sum += i; } for(int i = 1; i <= n; i++) cout << v[i] << "\n"; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...