Cod sursa(job #2530957)
Utilizator | Data | 25 ianuarie 2020 15:19:00 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 70 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <iostream>
#include <algorithm>
#include <fstream>
#include <cmath>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int v[2000005];
int main()
{
int n,c=0;
fin >>n;
for (int i=2;i*i<=n;++i)
{if (v[i]==1) {continue;}
for (int j=i+i;j<=n;j+=i) v[j]=1;
}
for (int i=2;i<=n;i++) if (v[i]==0) c++;
fout << c;
}