Cod sursa(job #1668094)
Utilizator | Data | 29 martie 2016 15:50:57 | |
---|---|---|---|
Problema | Fractii | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.39 kb |
#include<fstream>
using namespace std;
ifstream fi("fractii.in");
ofstream fo("fractii.out");
int k=0;
int divizor(int a,int b){
if(a==b) return a;
else if(a>b) divizor(a-b,b);
else divizor(a,b-a);
}
int main(){
int n;
fi>>n;
for(int i=2;i<=n;i++)
for(int j=i;j<=n;j++)
if(divizor(i,j)==1) k++;
fo<<2*n-1+2*k;
fi.close();
fo.close();
return 0;
}