Cod sursa(job #1667901)
| Utilizator | Data | 29 martie 2016 12:49:45 | |
|---|---|---|---|
| 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=1;i<=n;i++)
for(int j=1;j<=n;j++)
if(divizor(i,j)==1) k++;
fo<<k<<" ";
fi.close();
fo.close();
return 0;
}
