Cod sursa(job #1047997)
| Utilizator | Data | 5 decembrie 2013 02:54:53 | |
|---|---|---|---|
| Problema | Fractii | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.6 kb |
#include<fstream>
using namespace std;
int divizor(long long a,long long b)
{
int rest=0;
while(b) {
rest=a%b;
a=b;
b=rest;
}
return a;
}
int main() {
ifstream f("fractii.in");
ofstream g("fractii.out");
int a,i,j,nr=0;;
while(!f.eof()) {
f>>a;
nr=0;
for( i=1 ; i<=a; i++) {
for ( j=2 ; j<=a; j++) {
if(divizor(i,j)==1) {
nr++;
}
}
}
nr+=a;
g<<nr<<'\n';
}
f.close();
g.close();
return 0;
}
