Cod sursa(job #2244668)
Utilizator | Data | 23 septembrie 2018 13:29:04 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
using namespace std;
const int NMAX = 2000000;
bool ciur[NMAX+2];
ifstream in("ciur.in");
ofstream out("ciur.out");
int main()
{
int n,s=0;
in>>n;
for(int i=2; i<=n; i++)
{
if(ciur[i]==0)
{
s++;
for(int j=i+i; j<=n; j=j+i)
{
ciur[j]=1;
}
}
}
out<<s;
}