Cod sursa(job #2331023)
Utilizator | Data | 29 ianuarie 2019 09:16:19 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <fstream>
#include<cstring>
#include<bitset>
using namespace std;
#define NUM 2000005
bitset <NUM> ciur;
int main()
{
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int cnt=0,n;
fin>>n;
for(int i=2; i<=n; i++)
{
if(ciur[i]==0)
{
cnt++;
if(1LL*i*i<=n)
{
for(int j=i*i; j<=n; j+=i)
{
ciur[j]=1;
}
}
}
}
fout<<cnt;
return 0;
}