제출 #722862

#제출 시각아이디문제언어결과실행 시간메모리
722862vjudge1Timovi (COCI18_timovi)C++17
40 / 80
1086 ms13196 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; int main() { ios_base::sync_with_stdio(0); cin.tie(0); ll n, k, m; cin >> n >> k >> m; if(n == 1){ cout << m << "\n"; return 0; } map<ll, ll> ma; bool a = 1; for(int i = 1; m > 0; ){ if(m >= k){ ma[i] += k; m -= k; }else{ ma[i] += m; break; } if(i == 1 && !a){ a = 1; }else if(i == n && a){ a = 0; } if(a)i++; else i--; } for(int i = 1; i <= n; i++){ cout << ma[i] << " "; }cout << "\n"; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...