Submission #722303

#TimeUsernameProblemLanguageResultExecution timeMemory
722303vjudge1Nadan (COCI18_nadan)C++17
50 / 50
15 ms23800 KiB
#include <bits/stdc++.h> #define B begin() #define E end() #define F first #define S second #define pb push_back #define pf push_front #define eb emplace_back #define ll long long #define ui unsigned int #define ull unsigned long long #define sts stable_sort using namespace std; const int MAXN = 1e6 + 4; const int MOD = 1e9 + 7; vector<int> add[MAXN]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int k, n; cin >> k >> n; vector<int> v(n + 1); ll 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...