Pagini recente » Cod sursa (job #1080211) | winter-challenge-2008/runda-2/solutii#sn | Profil dornescuvlad | Cod sursa (job #2405812) | Cod sursa (job #487716)
Cod sursa(job #487716)
#include <fstream.h>
int simplif (int x, int y)
{
long double i;
if (x>y)
{
for (i=2;i<=y;i++)
if (x%i==0 && y%i==0) return 0;
return 1;
}
else
{
for (i=2;i<=x;i++)
if (x%i==0 && y%i==0) return 0;
return 1;
}
}
int main ()
{
ifstream f ("fractii.in");
ofstream g ("fractii.out");
long double i,j,n,cont=0;
f>>n;
cont+=n; cont+=n-1;
for (i=1;i<=n;i++)
for (j=2;j<=n;j++)
{
if (i%j!=0 && simplif(i,j)) cont++;
if (i==j) cont--;
}
g<<cont;
}