# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
802014 | detroiddh | Radio (COCI22_radio) | C++17 | 994 ms | 143788 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
const ll maxn = 1e6 + 3;
const ll mod = 1e9 + 7;
int n, Q, xa[maxn];
bool on[maxn];
vector<int>prime[maxn];
set<int>s[maxn];
int st[4 * maxn];
void sang()
{
for(ll i = 2 ; i <= n ; ++i)
{
if(prime[i].empty())
{
for(ll j = i ; j <= n ; j += i)
{
prime[j].push_back(i);
}
}
}
}
int get(int si, int sl, int sr, int l, int r)
{
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |