Cod sursa(job #670599)
Utilizator | Data | 29 ianuarie 2012 15:59:58 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include<fstream>
using namespace std;
int main()
{
long long a,b,nr=1,n;
char v[2000001];
ifstream in("ciur.in");
in>>n;
in.close();
for(a=2; a<=n; a++)
v[a]=1;
for(a=3; a*a<=n; a+=2)
if(v[a]==1)
for(b=a; b*a<=n; b*=a)
v[a*b]=0;
for(a=3; a<=n; a+=2)
if(v[a]==1)
nr++;
ofstream out("ciur.out");
out<<nr;
out.close();
return 0;
}