제출 #81688

#제출 시각아이디문제언어결과실행 시간메모리
81688aminraNadan (COCI18_nadan)C++14
40 / 50
2 ms824 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; const int MOD = (int)998244353; const int MAXN = (int)18; const int MAXS = (int)(1 << 18 + 3); const int infint = (int)1e9; const ll inf = (ll)1e18; ll n, k, ans[MAXN]; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> k >> n; for (int i = 1; i <= n; i++) ans[i] = i; ll sum = n * (n + 1) / 2; ans[n] += k - sum; for (int i = 1; i <= n; i++) cout << ans[i] << "\n"; }

컴파일 시 표준 에러 (stderr) 메시지

nadan.cpp:6:32: warning: suggest parentheses around '+' inside '<<' [-Wparentheses]
 const int MAXS = (int)(1 << 18 + 3);
                             ~~~^~~
#Verdict Execution timeMemoryGrader output
Fetching results...