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