Cod sursa(job #1554306)
Utilizator | Data | 21 decembrie 2015 11:46:48 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <cstdio>
using namespace std;
int p[2000002],n,nr;
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%d",&n);
for(int i=2;i<n;i++)
{
for(int j=i+i;j<n;j+=i)
p[j]=1;
if(p[i]==0)
nr++;
}
printf("%d",nr);
return 0;
}