제출 #1205109

#제출 시각아이디문제언어결과실행 시간메모리
1205109tamzidHack (APIO25_hack)C++20
0 / 100
0 ms320 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) // { // ++mp[x[j] % i]; // cnt+=mp[x[j] % i]-1; // } // if(cnt == a) // break; // mp.clear(); // } std::vector<ll> x; ll i; for(i=2;i<=500000;++i) { x.push_back(i); ll a = collisions(x); if(a == 2) 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...