Cod sursa(job #2174053)
Utilizator | Data | 16 martie 2018 10:34:09 | |
---|---|---|---|
Problema | Fractii | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.35 kb |
#include<iostream>
using namespace std;
int GCD(int A, int B)
{
if(!B)
return A;
return GCD(B, A%B);
}
int main() {
int N,i,j,cmmdc,nr=0;
cin>>N;
for(i=1; i<=N; i++) {
for(j=1; j<=N; j++) {
cmmdc = GCD(i,j);
if(cmmdc == 1) nr++;
}
}
cout<<nr;
return 0;
}