Submission #124480

#TimeUsernameProblemLanguageResultExecution timeMemory
124480andreiomdNadan (COCI18_nadan)C++11
15 / 50
3 ms376 KiB
#include <iostream> using namespace std; const int NMAX = 1e2 + 5; int K, N, A[NMAX]; int main() { ios_base :: sync_with_stdio(false); cin.tie(NULL); cin >> K >> N; for(int i = 1; i <= N; ++i) A[i] = i; K -= (N * (N+1)) / 2; while(K) { for(int i = N; i >= 1 && K; --i) { ++A[i]; --K; } } for(int i = 1; i <= N; ++i) cout << A[i] << '\n'; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...