# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
361977 | israeladewuyi | Nadan (COCI18_nadan) | C++17 | 1 ms | 364 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.
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<pair<int,int>> vp;
#define int ll
#define PB push_back
#define pb pop_back
#define in insert
#define endl "\n"
#define MP make_pair
#define f first
#define Trav(a,x) for(auto &a: x)
#define sort(x) sort(x.begin(),x.end());
const int MOD = 998244353;
const int maxn = 1e5+1;
int a,b,c,d,k,n,m,s,x,y,ans;
int32_t main(){
ios::sync_with_stdio(0);
cin.tie(0);
cin>>k>>n;
for(int i = 1; i < n; i++){
cout<<i<<endl;
k-=1;
}
cout<<k;
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |