| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1367964 | hihi0908 | Hack (APIO25_hack) | C++20 | 804 ms | 16476 KiB |
#include "hack.h"
#include <bits/stdc++.h>
using namespace std;
int hack(){
long long MAXN = 1e6;
vector<long long> x;
for(int i = 1; i <= MAXN; i++){
x.push_back(i);
}
long long v = collisions(x);
// cout << v << '\n';
for(int i = 2; i <= MAXN; i++){
if(1ull * (MAXN % i) * (MAXN / i) == 1ull * v - i * (MAXN / i - 1) * (MAXN / i) / 2) return i;
}
return 2;
}| # | 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... | ||||
