Cod sursa(job #3221525)
Utilizator | Data | 7 aprilie 2024 12:37:04 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
#include <cmath>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bool v[2000003];
int main()
{
int n;
fin>>n;
int cnt=0;
for(int i=2; 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;
}