Cod sursa(job #1099051)
Utilizator | Andrei Andrei AndreiIstetul | Data | 5 februarie 2014 15:16:12 |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream>
#include <iostream>
#include <bitset>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
bitset <2000000> b;
int main()
{
int i=2,n,j,k=0;
f>>n;
while(i<=n)
{
if(b[i]==0)
{
for(j=i*2;j<=n;j+=i) b[j]=1;
++k;
}
++i;
}
g<<k;
}