Cod sursa(job #2029932)
Utilizator | Data | 30 septembrie 2017 17:39:32 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
bitset <2000002> ciur;
int n, sol;
int main()
{
ciur[1]=1;
in>>n;
for(int i=2; i<=n; i++)
if(!ciur[i])
{
sol++;
for(int j=i*2; j<=n; j+=i)
ciur[j]=1;
}
out<<sol;
return 0;
}