Cod sursa(job #870606)
Utilizator | Iuliana iuli33 | Data | 3 februarie 2013 18:16:02 |
---|---|---|---|
Problema | Fractii | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.42 kb |
#include<iostream>
#include<fstream>
using namespace std;
int divizor (int p, int q) {
int r;
while (q){
r=p%q;
p=q;
q=r;
}
return p;
}
int main(){
int p, q, n, nr;
nr=0;
ifstream f("fractii.in");
ofstream g("fractii.out");
f>>n;
for (p=2; p<=n; p++){
for (q=2; q<=n; q++){
if ((divizor(p, q))==1){nr++;}
}
}
nr=nr+n+n-1;
g<<nr;
f.close();
g.close();
return 0;
}