Submission #1307465

#TimeUsernameProblemLanguageResultExecution timeMemory
1307465ThylOneHack (APIO25_hack)C++20
0 / 100
8 ms524 KiB
#include "hack.h"
#include <vector>
#include <bits/stdc++.h>
using namespace std;
int hack(){
    const int MAXN = 1e6+1;
    bitset<MAXN> mem = 0;
    for(int n = 2 ; n <= 1e6 ; n+=1){
        if(!mem[n] && collisions({n, 2*n})==1){
            return n;
        }
        mem[2*n] = 1;

    }
    return -1;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...