# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
316537 | Dymo | Nadan (COCI18_nadan) | C++14 | 1 ms | 384 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 pb push_back
#define ll long long
#define pll pair<ll,ll>
#define ff first
#define ss second
#define endl "\n"
const ll maxn=5e3+50;
const ll mod =1e9+7;
const ll base=317;
ll dp[maxn][maxn];
unsigned f[maxn];
unsigned mu[maxn];
unsigned ll geth(ll i,ll j)
{
return f[j]-f[i-1]*mu[j-i+1];
}
ll kc[maxn][maxn];
ll cd[maxn];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
if (fopen("test.t", "r"))
{
freopen("test.inp", "r", stdin);
freopen("test.out", "w", stdout) ;
}
ll n, k;
cin>>n>>k ;
for (int i=1;i<=k-1;i++)
{
cout <<i<<endl;
n-=i;
}
cout <<n;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |