| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1299413 | tamzid | Gap (APIO16_gap) | C++20 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
#include "gap.h"
using namespace std;
long long findGap(int T, int N)
{
if(T == 1) {
l = 0, r = 1e18;
int i = 0, j = N - 1;
vector<int> a(N);
while(i <= j) {
ll mn, mx;
MinMax(l, r, mn, mx);
a[i] = mn;
a[j] = mx;
++i;
--j;
}
}
}
