Cod sursa(job #491048)
Utilizator | Adamescu Dragos dragos08 | Data | 9 octombrie 2010 14:08:40 |
---|---|---|---|
Problema | Fractii | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.43 kb |
#include <iostream.h>
#include <fstream.h>
int prime(int a, int b)
{
while (a!=b)
{
if (a>b) a=(a-b) ; else b=(b-a);
}
return a;
}
long int i,j,n,l,q, sum ;
void main()
{
ifstream input;
input.open("fractii.in");
ofstream output;
output.open("fractii.out");
input>>l ;
sum=0;
for (j=1; j<=l; j++)
{
for (q=1; q<=l; q++)
{
if ((prime(j,q)) == 1) sum++ ;
}
}
output<<sum << endl ;
}