Cod sursa(job #2308135)
| Utilizator | Data | 26 decembrie 2018 14:28:00 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 40 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
#include <bitset>
using namespace std;
ifstream f ("ciur.in");
ofstream g ("ciur.out");
bitset <1000002> v;
int main()
{
int n,i,j,nr=0,x;
f>>n;
v[0]=v[1]=1;
for(i=2;i<=n;i++)
{
if(v[i]==0)
{
for(j=i*2;j<=1000000;j+=i)
v[j]=i;
}
}
for(i=1;i<=n;i++)
{
if(v[i]==0)
{
nr++;
}
}
g<<nr;
return 0;
}
