Cod sursa(job #2332190)
Utilizator | Data | 30 ianuarie 2019 15:04:16 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
int n,nr;
bool ciur[2000006];
int main()
{
in>>n;
for(int i=2;i<=n;i++)
ciur[i]=1;
ciur[1]=0;
for(int i=2;i<=n;i++)
{
if(ciur[i]==1)
{
nr++;
for(int j=i+i;j<=n;j=j+i)
ciur[j]=0;
}
}
out<<nr;
}