# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
568639 | beaconmc | Carnival (CEOI14_carnival) | C++14 | 43 ms | 356 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>
typedef long long ll;
#define FOR(i,x,y) for(ll i=x; i<y; i++)
#define FORNEG(i,x,y) for(ll i=x; i>y; i--)
using namespace std;
int main(){
ll n;
cin >> n;
ll c;
cout<< n << " ";
FOR(i,1,n+1) cout << i << " " ;
cout << endl;
cin >> c;
vector<vector<ll>> tings(c);
set<ll> sussy;
ll prev = c;
FORNEG(i,n-1,0){
ll sus = 0;
cout << i << " ";
FOR(j,1,i+1){
cout << j << " ";
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |