| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1345989 | ahmetlbktd4 | Hack (APIO25_hack) | C++20 | 45 ms | 432 KiB |
#include "hack.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int hack() {
int g = 0;
for (int _ = 0;_ < 25;_++){
vector <ll> x;
for (int i = 0;i < 100;i++){
x.push_back(1ll*rand()*rand()%(int)1e9+1);
}
for (int i = 0;i < x.size();i++){
for (int j = i+1;j < x.size();j++){
if ((x[i]%(int)1e6) == (x[j]%(int)1e6))
continue;
vector <ll> q = {x[i],x[j]};
if (collisions(q))
g = __gcd(g,(int)abs(x[i]-x[j]));
}
}
}
return g;
}| # | 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... | ||||
