Cod sursa(job #372491)
Utilizator | Data | 10 decembrie 2009 15:55:17 | |
---|---|---|---|
Problema | Fractii | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.41 kb |
#include<fstream.h>
int prim(long n,long m){
while(m!=0 && n!=0)
(m>n?m=m%n:n=n%m);
if(n!=0) return n;
return m;
}
ifstream f("fractii.in");
ofstream g("fractii.out");
int main(){
long t,n,m,nr=0;
f>>t;
nr+=t*2-1;
for(n=2;n<=t;n++)
for(m=2;m<=t;m++)
nr+=(prim(n,m)==1);
g<<nr;
g.close();
return 0;
}