Pagini recente » Cod sursa (job #432583) | Cod sursa (job #2415347) | Cod sursa (job #3228966) | Istoria paginii runda/proba123451 | Cod sursa (job #536331)
Cod sursa(job #536331)
#include<iostream.h>
#include<fstream.h>
int main()
{
ifstream f("fractii.in");
ofstream g("fractii.out");
int i,j,N,x[100000],nr=0,a,b,r;
f>>N;
if (N>=1 && N<=1000000)
{
x[0]=1;
for (i=1;i<N;i++)
x[i]=x[i-1]+1;
for (i=0;i<N;i++)
for (j=0;j<N;j++)
{
a=x[i];
b=x[j];
while (b!=0)
{
r=a%b;
a=b;
b=r;
}
if (a==1)
nr++;
}
g<<nr;
}
return 0;
}