Cod sursa(job #1586440)
Utilizator | Data | 1 februarie 2016 10:31:27 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <stdio.h>
#define Max 1000000
using namespace std;
int i,j,ok[Max],nr;
long n;
int main()
{ freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
scanf("%d", &n);
for(i=2;i<n;i++)
ok[i]=0;
for(i=2;i*i<n;i++)
for(j=2;i*j<n;j++)
ok[i*j]=1;
for(i=2;i<n;i++)
if(ok[i]==0) {nr++;}
printf("%d\n", nr);
return 0;
}