Cod sursa(job #2255971)
Utilizator | Data | 7 octombrie 2018 19:39:15 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bool v[500004];
int s[500004],i,j,q,n,a,b;
int main()
{
fin>>n;
v[0]=v[1]=0;
for(int i=2;i*i<=n;i++)
if(v[i]==0)
for(j=i;j*i<=n;j++)
v[i*j]=1;
for(i=2;i<=n;i++)
{
s[i]=s[i-1];
if(v[i]==0)
s[i]++;
}
fout<<s[n];
return 0;
}