# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1162561 | argo | Hiperkocka (COCI21_hiperkocka) | C++20 | 0 ms | 320 KiB |
#include <bits/stdc++.h>
#define all(x) x.begin(),x.end()
#define inf 1e18
#define mod 1e9+7
#define ll long long
#define ld long double
#define pb push_back
#define em emplace_back
#define bll __int128_t
using namespace std;
template <typename H, typename T>
ostream& operator<<(ostream& os, pair<H, T> m){return os <<"("<< m.first<<", "<<m.second<<")";}
template <typename H>
ostream& operator<<(ostream& os, vector<H> V){os<<"{";for(int i=0; i<(int)V.size(); i++){if(i)os<<" ";os<<V[i];}os<<"}";return os;}
void debug(){cerr << "\n";}
template<typename H, typename... T>
void debug(H h, T... t){cerr << h;if(sizeof...(t)){cerr<<" ";debug(t...);}}
#define deb(x...) cerr<<__LINE__ << ": " << #x << " -> ";debug(x);cerr<<endl;
int losuj(int a, int b){return rand()%(b-a+1)+a;}
#define rozmiar 100100
int n, a, b, pot2=1;
vector<pair<int, int>> drzewo;
map<int, int> numeracja;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
cin >> n;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |