Cod sursa(job #675062)
Utilizator | Data | 7 februarie 2012 08:29:52 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
/*
Problema:
*/
#include <fstream>
#include<bitset>
using namespace std;
int n,i,j,k;
bitset<2000002> a;
int main()
{
ifstream f("ciur.in");
f>>n;
f.close();
for(i=2;i<=n;i++)
if(!a[i])
for(j=i*2;j<=n;j+=i)
a[j]=true;
for(i=2;i<=n;i++)
if(!a[i])
k++;
ofstream g("ciur.out");
g<<k;
g.close();
return 0;
}