Cod sursa(job #1637031)
Utilizator | Data | 7 martie 2016 14:25:43 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n,i,j,nr;
bool ciur[2000001];
int main()
{
fin>>n;
for(i=2;i<=n;i++)
for(j=2;i*j<=n;j++)
ciur[i*j]=1;
for(i=2;i<=n;i++)
if(ciur[i]==0)
nr++;
fout<<nr;
}