Cod sursa(job #2241705)
| Utilizator | Data | 16 septembrie 2018 19:28:14 | |
|---|---|---|---|
| Problema | Fractii | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.62 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("fractii.in");
ofstream fout ("fractii.out");
int euclid(int a, int b)
{
int c;
while (b)
{
c=a%b;
a=b;
b=c;
}
return a;
}
int main()
{
int N;
fin>>N;
int a=1, b=1;
int c=0;
for (int a=1; a<=N; a++)
{
for (int b=1; b<=N; b++)
{
if (a==b&&b==1)
{
c++;
}
else if(euclid(a, b)==1)
{
c++;
}
}
}
fout<<c;
return 0;
}
