oj.uz

Submission #106634

# Submission time Handle Problem Language Result Execution time Memory
106634 2019-04-19T10:47:02 Z stefdasca Nadan (COCI18_nadan) C++14
50 / 50
 3 ms 412 KB 
#include<bits/stdc++.h>
#pragma GCC optimize("O3")
#define mod 1000000007
#define fi first
#define se second
using namespace std;
int n, k, sol[102];
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
    // shuffle(permutation.begin(), permutation.end(), rng);
    cin >> k >> n;
    for(int i = 1; i < n; ++i)
        sol[i] = i, k -= i;
    sol[n] = k;
    for(int i = 1; i <= n; ++i)
        cout << sol[i] << '\n';
    return 0;
}

Subtask #1
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 3 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 412 KB Output is correct
10 Correct 3 ms 384 KB Output is correct