Cod sursa(job #2028564)
Utilizator | Data | 28 septembrie 2017 01:39:37 | |
---|---|---|---|
Problema | Fractii | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 1.16 kb |
#include<iostream>
#include<fstream>
#include<cmath>
using namespace std;
ifstream f("fractii.in");
ofstream fout("fractii.out");
int n, nrf, i, j, nr, ok, maxx,k, p, pp, ii, rr, r;
int main(){
while( f>>n ){
nrf=0;
for( i=1; i<=n; i++){
p=1;
nr=0;
while( p<=n ){
pp=p;
ii=i;
if( pp>ii)
swap(pp,ii);
while(ii!=0){
r = pp%ii;
pp=ii;
ii=r;
}
if( pp!=1 )
nr++;
p++;
}
nrf+=n-nr;
}
fout<<nrf<<'\n';
}
return 0;
}