Cod sursa(job #1367494)
Utilizator | Data | 1 martie 2015 21:48:19 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include <iostream>
#include <fstream>
#include<bitset>
using namespace std;
int n,i,j,s,x;
bitset <2000009> v;
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>x;
for(i=2;i<=x/2;i++)
if(v[i]==0)for(j=2;j<=x/i;j++)v[i*j]=1;
for(i=2;i<=x;i++)if(v[i]==0)s++;
g<<s;
return 0;
}