# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1144798 | speedy_boy | Vepar (COCI21_vepar) | C++20 | 392 ms | 49356 KiB |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
//#define int long long
#define pb push_back
#define F first
#define S second
const int mod = 1e9 + 7;
const int N = 1e7 + 5;
const int INF = 1e9;
bool p[N];
int cnt[N];
vector<int> v;
void sieve(){
fill(p + 2 , p + N , 1);
for(int i = 2; i * i < N; i++){
if(p[i]){
for(int j = i * i; j < N; j += i)
p[j] = 0;
}
}
}
void solve()
{
int a , b , c , d;
cin >> a >> b >> c >> d;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |