Cod sursa(job #679019)
Utilizator | Data | 12 februarie 2012 17:35:51 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include<fstream>
using namespace std;
int n,k=1;
bool v[2000010];
void ciur() {
int i;
long long j;
for(i=3;i<=n;i+=2)
if(v[i]==0) {
k++;
for(j=1LL*i*i;j<=n;j=j+i)
v[j]=1;
}
}
int main()
{
ifstream in("ciur.in");
ofstream out("ciur.out");
in>>n;
ciur();
out<<k<<'\n';
in.close();
out.close();
return 0;
}