| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1345975 | ahmetlbktd4 | Hack (APIO25_hack) | C++20 | 2 ms | 448 KiB |
#include "bits/stdc++.h"
#include "hack.h"
#define ll long long
using namespace std;
ll barla(int l,int r){
int m = sqrt(r-l);
vector <ll> x;
for (int i = 1;i <= m;i++){
x.push_back(i);
}
for (int i = max(l,m)+m;i <= r;i+=m){
x.push_back(i);
}
x.push_back(r+1);
return collisions(x);
}
int hack(){
int l = 1,r = 1e6;
while (l+1 < r){
int m = (l+r) >> 1;
if (barla(l,m))
r = m;
else l = m+1;
}
if (collisions({1,l+1}))
return l;
else return l+1;
}| # | 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... | ||||
