| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1361087 | isct | Hack (APIO25_hack) | C++20 | 811 ms | 16472 KiB |
#include "hack.h"
#include <vector>
#include <bits/stdc++.h>
using namespace std;
vector<long long> make_vec(long long last)
{
vector<long long> res = {};
for (long long i = 1; i <= last; i++)
{
res.push_back(i);
}
return res;
}
int hack()
{
vector<long long> x = make_vec(1e6);
long long predicted = 0;
long long a = collisions(x);
for (long long i = 2; i <= 1e6; i++)
{
long long k = 1e6 / i;
predicted = i * k * (k - 1) / 2;
predicted += (k) * (1e6 - i * k);
if (a == predicted)
return i;
}
}Compilation message (stderr)
| # | 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... | ||||
