# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
846051 | vjudge1 | Trener (COCI20_trener) | C++17 | 3 ms | 2652 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 optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#pragma GCC optimize("O3,fast-math,inline")
#include <bits/stdc++.h>
using namespace std;
#define fr freopen("in.txt","r",stdin);freopen("out.txt","w",stdout);
#define int long long
#define endl "\n"
const int mod = (int)(1e9+7);
#define all(x) x.begin(),x.end()
int mxn = 1e18;
int mnn = -mxn;
void outarr(int ans[],int n)
{
for (int i = 0; i < n; i++) cout << ans[i] << " \n"[i == n - 1];
}
int binpow(int base,int power)
{
if(power == 1) return base;
if(power == 0) return 1;
if(power&2)
{
int a;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |