#include <stdio.h>
#include <stdlib.h>
#include<math.h>
int check(int m);
int main()
{
int i;
int t;
int clannad;
int counter;
int flag;
int prime[300];
int count=1;
prime[0]=2;
for(t=2;t<750;t++)
{
if(check(t))
{
prime[count]=t;
count++;
}
}
for(i=12;i<=3000;i++)
{
int shuzu[3]={0,0,0};
flag=1;
counter=0;
clannad=i;
for(t=0;t<=count+1;t++)
{
if(clannad%prime[t]==0)
{
clannad/=prime[t];
shuzu[counter]=prime[t];
counter++;
t--;
if(counter==3&&clannad!=1)
{
flag=0;
break;
}
else if(counter==3&&clannad==1)
{
flag=1;
break;
}
continue;
}
}
if((shuzu[0]!=0&&shuzu[1]!=0&&shuzu[2]!=0))
{
if(flag)
{
if((shuzu[0]==shuzu[1]&&shuzu[0]!=shuzu[2])||(shuzu[0]==shuzu[2]&&shuzu[0]!=shuzu[1])||(shuzu[2]==shuzu[1]&&shuzu[0]!=shuzu[2]))
{
printf("%d\n",i);
}
}
}
}
return 0;
}
int check(int m)
{
int flag=1;
int l;
for(l=2;l<sqrt(m)+1;l++)
{
if(m%l==0)
{
flag=0;
}
if(flag==0)
break;
}
if(flag==1)
return 1;
else
return 0;
}
#include <stdlib.h>
#include<math.h>
int check(int m);
int main()
{
int i;
int t;
int clannad;
int counter;
int flag;
int prime[300];
int count=1;
prime[0]=2;
for(t=2;t<750;t++)
{
if(check(t))
{
prime[count]=t;
count++;
}
}
for(i=12;i<=3000;i++)
{
int shuzu[3]={0,0,0};
flag=1;
counter=0;
clannad=i;
for(t=0;t<=count+1;t++)
{
if(clannad%prime[t]==0)
{
clannad/=prime[t];
shuzu[counter]=prime[t];
counter++;
t--;
if(counter==3&&clannad!=1)
{
flag=0;
break;
}
else if(counter==3&&clannad==1)
{
flag=1;
break;
}
continue;
}
}
if((shuzu[0]!=0&&shuzu[1]!=0&&shuzu[2]!=0))
{
if(flag)
{
if((shuzu[0]==shuzu[1]&&shuzu[0]!=shuzu[2])||(shuzu[0]==shuzu[2]&&shuzu[0]!=shuzu[1])||(shuzu[2]==shuzu[1]&&shuzu[0]!=shuzu[2]))
{
printf("%d\n",i);
}
}
}
}
return 0;
}
int check(int m)
{
int flag=1;
int l;
for(l=2;l<sqrt(m)+1;l++)
{
if(m%l==0)
{
flag=0;
}
if(flag==0)
break;
}
if(flag==1)
return 1;
else
return 0;
}