Cod sursa(job #963505)
Utilizator | Data | 17 iunie 2013 17:21:02 | |
---|---|---|---|
Problema | Fractii | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
using namespace std;
int euclid(int i, int j){
int r, a, b;
a=i; b=j;
while (b){
r=a%b;
a=b;
b=r;
}
return a;
}
int main(){
int n, i, j, fr=0;
ifstream f("fractii.in");
ofstream g("fractii.out");
f>>n;
for (i=1; i<=n; i++)
for (j=1; j<=n; j++){
if (euclid(i,j)==1) fr++;
}
cout<<fr;
return 0;
f.close();
g.close();
}