Cod sursa(job #2350422)
Utilizator | Gazdac Alexandru Eugen [email protected] | Data | 21 februarie 2019 12:37:52 |
---|---|---|---|
Problema | Fractii | Scor | 10 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream in("fractii.in");
ofstream out("fractii.out");
int const maxim=100000;
int euclid(int a,int b){
if(!b)return a;
return euclid(b,a%b);
}
int main(){
int n,contor=0;
in >> n;
if(n==1)out << 1;
else{
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
if(euclid(i,j)==1)contor++;
}
}
out << contor;
}
return 0;}