| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1361692 | opeleklanos | Hack (APIO25_hack) | C++20 | 81 ms | 428 KiB |
#include <iostream>
#include <vector>
using namespace std;
#include "hack.h"
// int secretNum = 8;
int mx = 1000000;
// int collisions(vector<int> v){
// vector<int> newV(mx+1, 0);
// for(auto i : v) newV[i%secretNum]++;
// int ans = 0;
// for(auto i : newV) ans += max(0, i-1);
// return ans;
// }
int hack(){
for(int i = 2; i<mx; i++){
if(collisions({1, i})) return i-1;
}
return -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... | ||||
