# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
7492 | gs13105 | 경비원 (GA8_guard) | C++98 | 764 ms | 1164 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 <stdio.h>
bool chk[2223];
int pri[331];
int arr[2222];
bool sta[20];
bool tmp[331];
int mem[16384];
int n;
int g(int x,int y)
{
return x?g(y%x,x):y;
}
int f(int x)
{
if(x==n)
{
int s=0,i,j;
for(i=0;i<n;i++)
s+=sta[i];
if(s<2)
return 0;
for(i=0;i<n;i++)
if(sta[i])
for(j=i+1;j<n;j++)
if(sta[j]&&g(arr[i],arr[j])>1)
return 0;
return 1;
# | 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... |