Submission #1205110

#TimeUsernameProblemLanguageResultExecution timeMemory
1205110tamzidHack (APIO25_hack)C++20
0 / 100
3094 ms8436 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); std::vector<ll> x; for(ll i=1;i<=500000;++i) x.push_back(i); ll c = collisions(x); ll n; for(n=2;n<=500000;++n) { std::map<ll,ll> mp; ll a = 0; for(ll &x2 : x) { a+=mp[x2 % n]; ++mp[x2 % n]; } if(a==c) break; } return n; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...