Cod sursa(job #2028911)
Utilizator | Data | 28 septembrie 2017 20:25:27 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
int n,nr=0,a[1000];
for(int i=0;i<1000;i++)
a[i]=1;
scanf("%d",&n);
for(int i=2;i*i<=n;i++)
if(a[i]==1)
for(int j=i*i;j<=n;j+=i)
a[j]=0;
for(int i=2;i<=n;i++)
if(a[i]==1)
nr++;
printf("%d",nr);
return 0;
}