Cod sursa(job #315467)
Utilizator | Data | 15 mai 2009 19:00:29 | |
---|---|---|---|
Problema | Fractii | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.38 kb |
#include<fstream.h>
#include<math.h>
int prim(long n)
{
if(n%2==0) return 0;
for(long k=2;k<=sqrt(n);k++) if(n%k==0) return 0;
return 1;
}
int main()
{
ifstream f("fracti.in");
ofstream g("fractii.out");
long n,sem;
long s=0;
f>>n;
long i;
s=n*n-(n/2)*(n/2);
for(i=3;i<=n;i++) if(prim(i)==1) s-=(n/i)*(n/i);
g<<s;
f.close();
g.close();
return 0;
}