Cod sursa(job #1718713)
Utilizator | Data | 18 iunie 2016 21:39:47 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <stdio.h>
#define lenght 2000000
using namespace std;
int main()
{
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
int n;
scanf("%d", &n);
char v[lenght];
for(int i=2; i<=n; i++) v[i]=1;
int k=0;
for(int i=2; i<=n; i++)
if(v[i])
{
k++;
for(int j=i*i; j<=n; j+=i)
v[j]=0;
}
printf("%d", k);
}