Cod sursa(job #1807719)
Utilizator | Data | 16 noiembrie 2016 21:07:21 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int ciur[2000001];
int main()
{
int x, a=2, k=0;
fin>>x;
while(a<=x)
{
while(ciur[a]==1&&a<=x)
a++;
for(int i=2; i*a<=x; i++)
ciur[a*i]=1;
a++;
}
for(int i=2; i<x; i++)
if (ciur[i]!=1)
k++;
fout<<k;
}