Cod sursa(job #1916475)
Utilizator | Data | 9 martie 2017 09:34:33 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n,j,cnt,i;
int s[2001000];
int main()
{
fin>>n;
for(i=2;i<=n;i++)s[i]=1;
for(i=2;i*i<=n;i++)
if(s[i])
for(j=i*i;j<=n;j+=i)
s[j]=0;
for(i=1;i<=n;i++)
if(s[i]==1) cnt++;
fout<<cnt;
return 0;
}