| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 742981 | Abdurroshid | Permutation (APIO22_perm) | C++17 | 0 ms | 0 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.
/*
It is code Zhanabergen Abdurroshid :))))
*/
//#pragma GCC target( "sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("Ofast,unroll-loops,fast-math,O3")
//#include "perm.h"
#include<bits/stdc++.h>
#define ll long long
//#define int ll
#define du long double
#define m_p make_pair
#define p_b push_back
#define pii pair<int,int>
#define piii pair<int,pii>
#define vi vector<int>
#define vii vector<pii>
#define viii vector<piii>
#define si set<int>
#define sii set<pii>
#define siii set<pair<int,pii> >
#define F first
#define S second
#define pre(x) cout.precision(x);
#define sz size()
#define all(x) x.begin(),x.end()
#define RUN ios_base::sync_with_stdio(false);cin.tie(0)
#define OPEN freopen("painter.in","r",stdin);freopen("painter.out","w",stdout)
using namespace std;
ll fl(){
ll a;
cin>>a;
return a;
}
const ll N = 5e5 + 9, N2 = 1e6 + 9, INF = 1e9 + 9, MOD = 1e9 + 7, BL = 200;
int* construct_permutation(int k){
static int b[100];
for(int i=0;i<k-1;i++)b[i] = i;
return b;
}
/*main(){
RUN;
return 0;
}*/