Pagini recente » Cod sursa (job #1282641) | Cod sursa (job #1629369) | Cod sursa (job #1957552) | Cod sursa (job #3262337) | Cod sursa (job #2233559)
#include <iostream>
using namespace std;
/*ifstream in("mins.in");
ofstream out("mins.out");*/
#define MAX 100001
int v[MAX][20];
int main()
{
int n,l=2,scadere=0,c,d,p,x,j,i,sol=0,ok;
cin>>c;
for(i=2; i<=MAX; i+=2)
v[i][1]=2;
for(i=3; i<=MAX; i+=2)
if(v[i][1]==0)
{
v[i][1]=i;
for(j=2*i; j<=MAX; j+=i)
{
for(x=1; v[j][x]!=0 && x<=20;)
x++;
v[j][x]=i;
}
}
for(i=3; i<=MAX; i++)
if(v[i][1]==0)
v[i][1]=i;
/*for(i=1; i<=5001; i++)
{
cout<<i<<" des in f primi ";
for(j=1; j<=5; j++)
cout<<v[i][j]<<" ";
cout<<endl;
}*/
for(i=1; i<=c; i++)
for(j=1; j<=c; j++)
{
ok=1;
for(x=1; x<=20 && v[i][x]!=0; x++)
{
for(p=1; p<=20 && v[j][p]!=0; p++)
{
if(v[i][x]==v[j][p] && v[i][x]!=0 && v[j][p]!=0)
{
ok=0;
break;
}
}
if(ok==0)
break;
}
if(ok==1) sol++;
}
cout<<sol;
return 0;
}