Cod sursa(job #1271840)
Utilizator | Data | 22 noiembrie 2014 13:22:42 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <cstdio>
using namespace std;
int ciur[2000000];
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
int n,p=0;
scanf("%d",&n);
for(int i=2;i<=n;i++)
if(ciur[i]==0)
{
p++;
for(int m=i*2;m<=n;m+=i)
ciur[m]=1;
}
printf("%d\n",p);
return 0;
}