Cod sursa(job #395640)
Utilizator | Data | 13 februarie 2010 16:28:02 | |
---|---|---|---|
Problema | Fractii | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.46 kb |
#include <fstream.h>
#include <iostream.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;
}
int main(){
long N,nr=0,i,j;
ifstream fisin("fractii.in");
fisin>>N;
fisin.close();
nr+=N*2-1;
for(i=2;i<=N;i++)
for(j=2;j<=N;j++)
nr+=(prim(i,j)==1);
ofstream fisout("fractii.out");
fisout<<nr;
fisout.close();
return 0;
}