Cod sursa(job #1512949)
Utilizator | Data | 28 octombrie 2015 20:08:24 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream q("ciur.out");
bool ciur[2000009];
int main()
{
int n,nr;
f>>n;
nr=0;
for (int d=2;d<=n;d++)
{
if (!ciur[d])
{
nr++;
for (int j=d+d;j<=n;j+=d)
{
ciur[j]=true;
}
}
}
q<<nr;
f.close();
q.close();
}