Cod sursa(job #1698186)
Utilizator | Data | 3 mai 2016 22:45:12 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <iostream>
#include <fstream>
using namespace std;
bool v[2000001];
int ciur[1000000],nciur;
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
int N;
f>>N;
f.close();
ciur[++nciur]=2;
for(int i=3;i<=2000001;i+=2)
{
if(v[i]==false)
ciur[++nciur]=i;
if(1LL*i*i<=2000001LL)
for(int k=i;k*i<=2000001;k+=2)
v[k*i]=true;
}
int k=0;
for(int i=1;ciur[i]<=N;i++)
k++;
g<<k;
g.close();
return 0;
}