# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
161142 | sans | Nadan (COCI18_nadan) | C++14 | 4 ms | 376 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define sp ' '
#define endl '\n'
#define st first
#define nd second
#define pb push_back
#define mp make_pair
#define forn(YY, yy) for(int yy = 0; yy < YY; ++yy)
typedef long long int ll;
typedef unsigned long long int ull;
const int MOD = 1e9 + 7;
const int INF = 2e9;
ll K, N;
//Input
void input(void)
{
cin >> K >> N;
}
int main(int argc, char **argv)
{
ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);
input();
for(int i = 1; i <= N-1; ++i)
cout << i << endl;
cout << K - ((N-1)*N/2) << endl;
return 0;
}
//cikisir
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |