Submission #1218783

#TimeUsernameProblemLanguageResultExecution timeMemory
1218783abdelhakimHack (APIO25_hack)C++20
0 / 100
3075 ms78696 KiB
#include "hack.h" #include <bits/stdc++.h> #define ll long long #define dbg(x) cerr << #x << ' ' << x << endl; using namespace std; int hack() { vector<ll> x; for (int i=1;i<=1e6;i++) { x.push_back(i); } map<ll,ll> id; ll maxn=1e6; for (int n=2;n<=1e6;n++) { ll val=maxn/n*(maxn) - n*((1+maxn/n)*(maxn/n))/2; id[val]=n; } ll ans=collisions(x); return id[ans]; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...