Pagini recente » Cod sursa (job #1840298) | Cod sursa (job #1610291) | Cod sursa (job #1451857) | Cod sursa (job #1853213) | Cod sursa (job #341376)
Cod sursa(job #341376)
#include <fstream.h>
#include <math.h>
int N,S,P[10001],contor;
ifstream fin("fractii.in");
ofstream fout("fractii.out");
void prim()
{int i,j,prim;
for(i=2;i<=10000;i++)
{prim=0;
for(j=2;j<=sqrt(i);j++)
if(i%j==0) prim=prim+1;
if(prim==0) {contor=contor+1;
P[contor]=i;
}
}
}
int valid(int a,int b)
{int r;
for(int i=1;i<=contor;i++)
if(a%P[i]==0 && b%P[i]==0) return 0;
r=a%b;
while(r!=0)
{
a=b;
b=r;
r=a%b;
}
if (b==1) return 1;
else return 0;
}
void Generare()
{int i,j;S=S+2*N-1;
for(i=2;i<=N;i++)
for(j=2;j<=N;j++)
if (valid(i,j)) S=S+1;
}
int main()
{
prim();
fin>>N;
Generare();
fout<<"\n"<<S<<"\n";
fin.close();
fout.close();
return 0;
}