Pagini recente » Cod sursa (job #2750912) | Cod sursa (job #2152104) | Cod sursa (job #1535884) | Cod sursa (job #2318082) | Cod sursa (job #1473612)
#include <iostream>
#include <fstream>
using namespace std;
int n, m[10000][10000];
ifstream in("fractii.in");
ofstream out("fractii.out");
void ciur(int *viz)
{
int i, j, k, p;
for(i=2;i<=n;++i)
if(viz[i]==0)
{
for(j=i;j<=n;j+=i)
{
viz[j]=1;
p=0;
for(k=1;k<=n;k++)
if(m[j][k]!=0)
p++;
m[j][p+1]=i;
}
viz[i]=0;
}
}
int main()
{
int i, r=0, ok, j, k, f;
in>>n;
int viz[n+1];
for(i=1;i<=n;++i)
{
viz[i]=0;
for(j=1;j<=n;j++)
m[i][j]=0;
}
ciur(viz);
for(i=2;i<=n;++i)
{
for(j=1;j<=n;++j)
{
ok=1;
for(f=1;f<=n;f++)
for(k=1;k<=n;k++)
if(m[i][k] == m[j][f] && m[i][k]!=0 && m[j][f]!=0)
ok=0;
if(ok==1) r++;
}
}
out<<r+n;
return 0;
}