Submission #1205100

#TimeUsernameProblemLanguageResultExecution timeMemory
1205100tamzidHack (APIO25_hack)C++20
0 / 100
622 ms26952 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::map<ll,ll> mp; ll cnt = 0; int i; for(i=1;i<=500000;++i) { for(int j=0;j<x.size();++j) { cnt+=mp[x[j] % i]-1; ++mp[x[j] % i]; } if(cnt == a) break; } return i; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...