Cod sursa(job #2252903)
Utilizator | Data | 3 octombrie 2018 11:45:07 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n,i,j;
bool v[2000001];
int main()
{
fin>>n;
for(i=2;i<=n/i;i++)
if(v[i]==0)
for(j=i*2;j<=n;j+=i)
v[j]=1;
j=0;
for(i=2;i<=n;i++)
if(v[i]==0) j++;
fout<<j;
return 0;
}