Cod sursa(job #1721878)
| Utilizator | Data | 26 iunie 2016 17:30:25 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <iostream>
#include <fstream>
#include <bitset>
using namespace std;
ifstream si("ciur.in");
ofstream so("ciur.out");
bitset<2000005>erat;
int ciur(int n)
{
int cont;
int i,j,k;
if(n==1)
return 0;
cont=1;
for(i=3;i<=n;i+=2)
{
if(!erat[i])
{
cont++;
k=i+i;
for(j=i+k;j<=n;j+=k)
{
erat[j]=1;
}
}
}
return cont;
}
int main()
{
int n;
si>>n;
so<<ciur(n);
return 0;
}
