Cod sursa(job #2100466)
Utilizator | Data | 5 ianuarie 2018 17:50:30 | |
---|---|---|---|
Problema | Fractii | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.34 kb |
#include <fstream>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
int euclid(int a,int b){
if(b==0) return a;
return euclid(b,a%b);
}
int main()
{int n,j;
int s,i;
s=0;f>>n;
for(i=1;i<=n;i++){
for(j=i+1;j<=n;j++){
if(euclid(i,j)==1) s++;
}
}s=s*2+1;
g<<s;
return 0;
}