Cod sursa(job #1572737)
Utilizator | Data | 19 ianuarie 2016 08:36:59 | |
---|---|---|---|
Problema | Fractii | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.43 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()
{
ifstream f("fractii.in");
ofstream g("fractii.out");
int n,k=0,i,j;
f>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(euclid(i,j)==1)
k++;
g<<k;
return 0;
}