Cod sursa(job #1461700)
Utilizator | Data | 16 iulie 2015 11:59:56 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include<cstdio>
#include<cmath>
using namespace std;
char v[2000010];
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
int n,i,d,prime=0,a,j;
scanf("%d",&n);
for(i=2;i<=n;++i)
{
if(v[i]==0)
{
for(j=i+i;j<=n;j+=i)
v[j]=1;
prime++;
}
}
printf("%d",prime);
}