| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1361769 | opeleklanos | Hack (APIO25_hack) | C++20 | 24 ms | 8368 KiB |
#include <iostream>
#include <vector>
using namespace std;
#include "hack.h"
#define ll long long
// int secretNum = 938572;
// int collisions(vector<int> v){
// vector<int> newV(secretNum +1, 0);
// int ans = 0;
// for(auto i : v){
// ans += newV[i%secretNum];
// newV[i%secretNum] ++;
// }
// return ans;
// }
int hack(){
ll l = 2, r = 1000000;
while(l!=r){
ll mid = (l+r)/2;
vector<ll> v = {1};
for(int i = l; i<=mid; i++) v.push_back(i);
if(collisions(v)) r = mid;
else l = mid+1;
}
return l-1;
}| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
