Cod sursa(job #2288066)
Utilizator | Data | 22 noiembrie 2018 20:26:52 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
#include <cmath>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
char v[2000001];
int main()
{
int n;
in>>n;
int a=sqrt(n);
for(int i=4; i<=n; i=i+2)
v[i]=1;
for(int i=3; i<=a; i=i+2)
if(v[i]==0)
for(int j=i+i; j<=n; j=i+j)
v[j]=1;
int cont=0;
for(int i=2;i<=n;i++)
if(v[i]==0)
cont++;
out<<cont;
}