Cod sursa(job #1926740)
Utilizator | Data | 14 martie 2017 17:32:06 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <bits/stdc++.h>
using namespace std;
bitset <2000003>a;
int main()
{
int n=0 , c=0;
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
a[1]=1;
for(int i=2; i<=n; i++)
if(a[i]==0)
for(int j=i+i; j<=n; j+=i)
a[j]=1;
c=0;
for(int i=2; i<=n; i++)
if(a[i]==0) c++;
g<<c;
return 0;
}