oj.uz

Submission #124480

# Submission time Handle Problem Language Result Execution time Memory
124480 2019-07-03T11:58:07 Z andreiomd Nadan (COCI18_nadan) C++11
15 / 50
 3 ms 376 KB 
#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;
}

Subtask #1
15.0 / 50.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB Output isn't correct
2 Incorrect 2 ms 376 KB Output isn't correct
3 Incorrect 2 ms 376 KB Output isn't correct
4 Correct 2 ms 376 KB Output is correct
5 Incorrect 2 ms 376 KB Output isn't correct
6 Incorrect 2 ms 376 KB Output isn't correct
7 Incorrect 2 ms 376 KB Output isn't correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Incorrect 3 ms 376 KB Output isn't correct