Cod sursa(job #752789)
Utilizator | Data | 29 mai 2012 16:18:59 | |
---|---|---|---|
Problema | Fractii | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.61 kb |
#include <fstream>
using namespace std;
long euclid(long a, long b)
{
long d;
if (a>b)
{
d=a;
a=b;
b=d;
}
d=0;
while (b)
{
d=a%b;
a=b;
b=d;
}
return (a==0 || a==1);
}
int main()
{
long c=1,N, P, Q;
ifstream fin("fractii.in");
fin>>N;
fin.close();
for (P=1; P<=N; P++)
for (Q=P; Q<=N; Q++) {
if (euclid(P,Q)==1 && P/Q!=1)
{
c+=2;
} break; }
ofstream fout("fractii.out");
fout<<c;
fout.close();
return 0;
}