| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1234881 | Hanksburger | Hack (APIO25_hack) | C++20 | 1234 ms | 16452 KiB |
#include "hack.h"
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int hack()
{
vector<ll> tmp;
for (ll i=1; i<=1000000; i++)
tmp.push_back(i);
ll res=collisions(tmp);
for (ll i=2; i<=1000000; i++)
if ((999999LL/i+1)*(999999LL/i)/2*(999999LL%i+1)+(999999LL/i)*(999999LL/i-1)/2*(i-999999LL%i-1)==res)
return i;
return 0;
}| # | 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... | ||||
