oj.uz

Submission #316274

# Submission time Handle Problem Language Result Execution time Memory
316274 2020-10-25T18:51:52 Z martinunter Nadan (COCI18_nadan) C++17
10 / 50
 1 ms 384 KB 
#include <iostream>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#define pb push_back
#define fr(n) for (int i = 0; i<n;i++)
typedef long long ll;
using namespace std;
ll pot (ll q, ll w){
    ll qw = 1;
    for (ll i = 0; i<w; i++)
        qw*= q;
    return qw;
}
int main () {
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);

int n;//broj kompanija kojima Nadan daje novac
int k;//koliko kuna ima

cin >> k;
cin >> n;

int t = 0;

for (int i=0; i<n-1; i++){
t++;
cout<< t << endl;
}
    cout << k-t;

return 0;
}

Subtask #1
10.0 / 50.0

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