# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
14330 | ggoh | 경비원 (GA8_guard) | C++98 | 577 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<queue>
#include<algorithm>
int D[2][32768],i,j,k,a,t,s,r,u,X=1e9+7,p[15]={2,3,5,7,11,13,17,19,23,29,31,37,41,43,47};
std::vector<int>x[2222];
main()
{
scanf("%d",&a);
for(i=0;i<a;i++)
{
scanf("%d",&r);
u=0;
for(j=0;j<15;j++)
{
if(r%p[j]==0)
{
u+=(1<<j);
while(r%p[j]==0)r/=p[j];
}
}
x[r].push_back(u);//r: 1 또는 47 초과 소수
}
//47 초과 소수가 없는 수들에 대해서
u=0;
D[0][0]=1;
for(i=0;i<x[1].size();i++)
{
for(j=0;j<32768;j++)
{
# | 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... |