Cod sursa(job #1067677)
Utilizator | Data | 27 decembrie 2013 12:24:02 | |
---|---|---|---|
Problema | Fractii | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
using namespace std;
int gcd(int a, int b)
{
if(a == 0) return b;
return gcd(b%a, a);
}
int main()
{
ifstream fin("fractii.in");
ofstream fout("fractii.out");
long int n;
int count= 0;
fin>>n;
for(int i=0;i< n; i++)
{
for(int j=0; j< n; j++)
{
if(gcd(i+1,j+1) == 1) count++;
}
}
fout << count<<endl;
return 0;
}