Cod sursa(job #1805877)
| Utilizator | Data | 14 noiembrie 2016 16:22:33 | |
|---|---|---|---|
| Problema | Fractii | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.52 kb |
#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 N;
int nr = 1;
int main()
{
fin >> N;
for (int i = 1; i <= N; i++)
for (int j = 1; j <= N; j++) {
if (i == j)
continue;
if (euclid(i,j) == 1)
nr++;
}
fout << nr;
return 0;
}
