Cod sursa(job #1560772)
Utilizator | Data | 3 ianuarie 2016 12:01:25 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
# include <cstdio>
# define N 2000010
using namespace std;
int sol,n;
bool prim[N];
int main()
{
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
scanf("%d\n", &n);
for(int i=2; i<=n; ++i)
prim[i]=true;
for(int i=2; i<=n; ++i)
if(prim[i]==true)
{
sol++;
for(int j=i; j<=n; j+=i)
prim[j]=false;
}
printf("%d\n", sol);
}