Cod sursa(job #1893451)
| Utilizator | Data | 25 februarie 2017 18:12:52 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
const int MAX= 2000000;
int a[MAX+1];
long long p[MAX/10];
void ciur()
{
int d, i, k=0;
for(d=2; d*d<=MAX; d++)
{
if(a[d]==0)
{
for(i=2; i<=MAX/d; i++)
{
a[d*i]=1;
}
}
}
for(d=2; d<=MAX; d++)
{
if(a[d]==0) p[++k]=d;
}
}
int main() {
int i,n, k=0;
fin>>n;
ciur();
for(i=1; p[i]<=n; i++) k++;
fout<<k;
return 0;
}