Cod sursa(job #1151713)
| Utilizator | Data | 24 martie 2014 12:28:31 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <iostream>
#include <cstdio>
#include <cstring>
#define Nmax 2000005
using namespace std;
int N,Nr;
int P[Nmax];
void Rezolvare()
{
memset(P,1,sizeof(P));
for(int i=2;i<=N;++i)
if(P[i])
{
Nr++;
for(int j=i+i;j<=N;j+=i)
P[j]=0;
}
}
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%d",&N);
Rezolvare();
printf("%d",Nr);
return 0;
}
