| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1205126 | tamzid | Hack (APIO25_hack) | C++20 | 115 ms | 416 KiB |
#include "hack.h"
#include <vector>
#include <map>
using ll = long long;
int hack(){
// std::vector<long long> x = {3333,2565454,21223,898997,9999,4,8,100,2340040,222,44,2222211};
// long long a = collisions(x);
int n = 0;
while(++n)
{
if(collisions({1,n+1}))
return n;
}
}Compilation message (stderr)
| # | 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... | ||||
