# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
7913 | gs13068 | 경비원 (GA8_guard) | C++98 | 512 ms | 1516 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>
#include<vector>
#include<algorithm>
#define MOD 1000000007
std::vector<int> a[2222];
int p[15]={2,3,5,7,11,13,17,19,23,29,31,37,41,43,47};
int d[2][32768];
int main()
{
int *now,*next,*temp;
int i,j,k,n,t;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&t);
k=0;
for(j=0;j<15;j++)if(t%p[j]==0)
{
k|=1<<j;
while(t%p[j]==0)t/=p[j];
}
a[t].push_back(k);
}
now=d[0];
next=d[1];
now[0]=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... |