# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
7292 | gs13068 | 경비원 (GA8_guard) | C++98 | 2000 ms | 1104 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<cstdio>
int a[2223];
int d[2223];
int dfs(int x)
{
if(x>2222)return 1;
int i,t,r=0;
if(a[x])
{
t=x;
for(i=2;i*i<=t;i++)
{
if(t%i==0&&d[i])break;
while(t%i==0)t/=i;
}
if(i*i>t&&!d[t])
{
t=x;
for(i=2;i*i<=t;i++)if(t%i==0)
{
d[i]=1;
while(t%i==0)t/=i;
}
if(t>1)d[t]=1;
r+=dfs(x+1)*a[x];
t=x;
# | 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... |