oj.uz

답안 #81689

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
81689 2018-10-26T07:48:22 Z aminra Nadan (COCI18_nadan) C++14
50 / 50
 2 ms 532 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
const int MAXN = (int)107;
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";
}

Subtask #1
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 372 KB Output is correct
3 Correct 2 ms 408 KB Output is correct
4 Correct 2 ms 408 KB Output is correct
5 Correct 2 ms 456 KB Output is correct
6 Correct 2 ms 456 KB Output is correct
7 Correct 2 ms 516 KB Output is correct
8 Correct 2 ms 516 KB Output is correct
9 Correct 2 ms 516 KB Output is correct
10 Correct 2 ms 532 KB Output is correct