Cod sursa(job #1739928)
Utilizator | Data | 10 august 2016 14:59:39 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
#define NMAX 2000001
using namespace std;
bool prim[NMAX];
int n;
int ct;
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
int main()
{
fin>>n;
int i;
for(i=2; i<=n; i++)
prim[i]=true;
int j;
for(i=2; i<=n; i++)
if(prim[i])
{
ct++;
for(j=i+i; j<=n; j=j+i)
prim[j]=false;
}
fout<<ct;
return 0;
}