Cod sursa(job #1180433)
Utilizator | Data | 30 aprilie 2014 17:24:06 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include<fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
int N,sol;
bool viz[2000010];
void ciur() {
int i;
long long j;
for(i=3;i<=N;i+=2)
if(!viz[i]){
sol++;
for(j=1LL*i*i;j<=N;j=j+i)
viz[j]=1;
}
}
int main() {
in>>N;
ciur();
if(N>=2)
out<<sol+1;
else
out<<0;
return 0;
}