Cod sursa(job #2270900)
Utilizator | Data | 27 octombrie 2018 18:46:05 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include<stdio.h>
using namespace std;
int prim[2000005],nr;
int main()
{
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
int n;
scanf("%d",&n);
for(int i=2;i<=n;i++)
if(!prim[i]){
++nr;
for(int j=i+i;j<=n;j+=i)
prim[j]=1;
}
printf("%d",nr);
}