Cod sursa(job #1107639)
Utilizator | Data | 14 februarie 2014 00:24:31 | |
---|---|---|---|
Problema | Fractii | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.54 kb |
#include <iostream>
#include <fstream>
using namespace std;
int euclid(int a, int b)
{
int c;
while (b) {
c = a % b;
a = b;
b = c;
}
return a;
}
int main()
{ int n;
ifstream f("fractii.in");
ofstream g("fractii.out");
f>>n;
int p,q,nr;
p=1;
q=1;
nr=0;
for (p=1;p<=n;p++)
for (q=1;q<=n;q++)
if (euclid(p,q) == 1) {
nr++;
}
g<<nr;
f.close();
g.close();
return 0;
}