| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1366921 | srividya_06 | Hack (APIO25_hack) | C++20 | 765 ms | 16088 KiB |
#include "hack.h"
#include <bits/stdc++.h>
#define REP(i,a,b) for(int i = a; i<b; i++)
#define RREP(i,a,b) for(int i = a; i>b; i--)
typedef long long ll;
using namespace std;
int hack(){
int mx = 1000000;
vector<long long> x(mx);
ll l = 2, r = mx;
iota(x.begin(), x.end(), 1);
ll co = collisions(x);
REP(i,l,r+1){
ll k = mx/i;
ll tmp = (i*k*(k-1))/2 + k*(mx%i);
if(tmp == co) return i;
}
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... | ||||
