Cod sursa(job #1736120)
Utilizator | Data | 1 august 2016 10:46:42 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
bool ciur[2000001];
int n,i,j,nr;
int main()
{
in>>n;
for(i=2; i<=n; i++)
ciur[i]=1;
for(i=2; i<=n; i++)
if(ciur[i])
for(j=2; i*j<=n; j++)
ciur[i*j]=0;
for(i=2; i<=n; i++)
if(ciur[i])
nr++;
out<<nr;
return 0;
}