Cod sursa(job #363743)
| Utilizator | Data | 14 noiembrie 2009 16:24:22 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.44 kb |
#include<fstream>
#include<iostream>
#include<queue>
using namespace std;
int main()
{
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
int n;
scanf("%d",&n);
char prim[2000001];
memset(prim,1,sizeof(prim));
int rez = 0;
for(int i=2; i<=n; i++)
if( prim[i]==1 )
{
rez++;
for(int j=2*i; j<=n; j+=i) prim[j] = 0;
}
printf("%d",rez);
return 0;
}
