# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
253898 | 2020-07-29T05:15:36 Z | Molukhyyeh | Nadan (COCI18_nadan) | C++14 | 1 ms | 256 KB |
#include <bits/stdc++.h> using namespace std; #define ll long long #define all(x) x.begin(),x.end() int const N = 200001; int main(){ int n, k; scanf("%d%d", &k, &n); int i = 1; if(k >= (n * (n+1))/2){ while(i < n && k > 0){ printf("%d\n", i++); k-=i; } printf("%d\n", k); } else { for(int j = 0; j<n-1; ++j)printf("1\n"); printf("%d\n", k-(n-1)); } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 256 KB | Output isn't correct |
2 | Incorrect | 1 ms | 256 KB | Output isn't correct |
3 | Incorrect | 0 ms | 256 KB | Output isn't correct |
4 | Correct | 1 ms | 256 KB | Output is correct |
5 | Incorrect | 1 ms | 256 KB | Output isn't correct |
6 | Incorrect | 1 ms | 256 KB | Output isn't correct |
7 | Incorrect | 0 ms | 256 KB | Output isn't correct |
8 | Correct | 0 ms | 256 KB | Output is correct |
9 | Incorrect | 0 ms | 256 KB | Output isn't correct |
10 | Incorrect | 0 ms | 256 KB | Output isn't correct |