Pagini recente » Cod sursa (job #3121110) | Cod sursa (job #598987) | Cod sursa (job #535690) | Cod sursa (job #500801) | Cod sursa (job #536823)
Cod sursa(job #536823)
#include <iostream.h>
#include <fstream.h>
int n;
int divizor(int a, int b)
{
int m=0, i;
if(((a%2==0)&&(b%2==0))||(a==b))
m=1;
else
for(i=3; i<=n; i+=2)
{
if((a%i==0)&&(b%i==0))
m=1;
}
return m;
}
int main()
{
int j, i, k=1, ok;
ifstream fin("fractii.in");
ofstream fout("fractii.out");
fin>>n;
for(i=1; i<=n; i++)
for(j=1; j<=n; j++)
{ ok=divizor(i, j);
if(ok==0)
k=k+1;
}
cout<<k;
fout<<k;
fin.close();
fout.close();
return 0;
}