Cod sursa(job #324281)
Utilizator | Data | 15 iunie 2009 12:48:39 | |
---|---|---|---|
Problema | Fractii | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.41 kb |
#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 i, j, n, ct=0;
ifstream f("fractii.in");
f>>n;
for (i = 1; i <= n; i++)
for(j = 1; j<=n; j++)
{
if (euclid(i,j)==1)
ct++;
}
ofstream g("fractii.out");
g<<ct;
f.close();
g.close();
return 0;
}