Cod sursa(job #925186)
| Utilizator | Data | 24 martie 2013 13:41:48 | |
|---|---|---|---|
| Problema | Fractii | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
using namespace std;
int euclid(int a, int b);
int main()
{
ifstream in("fractii.in");
ofstream out("fractii.out");
int p,q,n;
in>>n;
int i=0;
for(p=1;p<=n;p++)
{
for (q=1;q<=n;q++)
{
if(euclid(p,q)==1) i++;
}
}
out<<i;
}
int euclid(int a, int b)
{
int c;
while (b) {
c = a % b;
a = b;
b = c;
}
return a;
}
