Cod sursa(job #419416)
Utilizator | Data | 17 martie 2010 14:38:59 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.27 kb |
#include<fstream.h>
#include<math.h>
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,i,j,v[200000],nr;
int main()
{ f>>n;nr=n>>1;j=n;
while(n%2==0)n>>=1;
for(i=3;i<=j;i+=2)if(n%i==0)while(n%i==0)nr++,n/=i;
g<<j-nr;
f.close();
g.close();
return 0;
}