| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 87656 |
2018-12-01T16:45:37 Z |
Origims |
Nadan (COCI18_nadan) |
C++14 |
|
3 ms |
656 KB |
// In The Name Of God
#include <bits/stdc++.h>
#define sqr(A) ((A) * (A))
#define X first
#define Y second
#define MP make_pair
#define bsz __builtin_popcount
#define all(A) A.begin(), A.end()
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
const int MOD = 1e9 + 7;
const int MOD2 = 1e9 + 9;
const int PR = 727;
const int INF = INT_MAX;
const ll LINF = LLONG_MAX;
int n, k;
int main() {
ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
cin >> k >> n;
for (int i = 1; i < n; i++)
cout << i << endl, k -= i;
cout << k << endl;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
252 KB |
Output is correct |
| 2 |
Correct |
2 ms |
372 KB |
Output is correct |
| 3 |
Correct |
3 ms |
576 KB |
Output is correct |
| 4 |
Correct |
2 ms |
576 KB |
Output is correct |
| 5 |
Correct |
2 ms |
656 KB |
Output is correct |
| 6 |
Correct |
3 ms |
656 KB |
Output is correct |
| 7 |
Correct |
3 ms |
656 KB |
Output is correct |
| 8 |
Correct |
0 ms |
656 KB |
Output is correct |
| 9 |
Correct |
2 ms |
656 KB |
Output is correct |
| 10 |
Correct |
2 ms |
656 KB |
Output is correct |
