Cod sursa(job #2679513)
Utilizator | Data | 30 noiembrie 2020 18:13:44 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
using namespace std;
int v[2000001];
int main()
{
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n,cnt=0;
bool prim=true;
fin>>n;
for(int i=1;i<=n;i++)
v[i]=1;
v[1]=0;
for(int i=1;i<=n;i++){
if(v[i]==1)
for(int q=2*i;q<=n;q=q+i)
v[q]=0;
if(v[i]==1)
cnt++;
}
fout<<cnt;
return 0;
}