Cod sursa(job #1039526)
| Utilizator | Data | 23 noiembrie 2013 11:13:49 | |
|---|---|---|---|
| Problema | Fractii | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.41 kb |
#include<fstream>
using namespace std;
FILE*in;
ofstream out("fractii.out");\
int euclid(int par1, int par2)
{
int rest;
while (par2)
{
rest=par1%par2;
par1=par2;
par2=rest;
}
return par1;
}
int i, j, n, nr;
int main()
{
in=fopen("fractii.in","r");
fscanf(in,"%d",&n);
for (i=1; i<=n; i++)
for (j=1; j<=n; j++)
{
if (euclid(i, j)==1)
nr++;
}
out<<nr;
return 0;
}
