Cod sursa(job #3221557)
Utilizator | Data | 7 aprilie 2024 14:09:42 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
bool v[2000001];
int main()
{
int n,cnt=0;
fin>>n;
for (int i =2 ; i*i <= n ; i ++)
{
if(v[i]==0)
for(int j = 2 ; j<= n/i; j++)
{
v[i*j]=1;
}
}
for (int i = 2 ; i<= n; i++)
{
if (v[i]==0)
cnt++;
}
fout<<cnt;
return 0;
}