Cod sursa(job #2858970)
Utilizator | Data | 28 februarie 2022 18:05:37 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <fstream>
using namespace std;
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
int n;
int v[2000005], ans;
int main()
{
fin>>n;
v[0]=v[1]=1;
for(int i=2; i*i<=n; i++)
if(v[i]==0)
for(int j=i*i; j<n; j+=i)
v[j]=1, ans++;
fout<<ans;
return 0;
}