Cod sursa(job #1914201)
Utilizator | Data | 8 martie 2017 15:56:22 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <iostream>
#include <fstream>
#include <bitset>
using namespace std;
ifstream f ("ciur.in");
ofstream g ("ciur.out");
int n,i,j,k;
bitset <2000001> v;
int main()
{
f>>n;
v[1]=1;
for(i=2;i<=n;i++)
{
for(j=i+i;j<=n;j=j+i)
v[j]=1;
}
for(i=1;i<=n;i++)
if(v[i]==0) k++;
g<<k;
return 0;
}