Cod sursa(job #2495156)
Utilizator | Data | 18 noiembrie 2019 22:06:17 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.29 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,i,nr,j;
bool prim[2000000];
int main()
{
f>>n;
for(i=2;i<=n;i++)
if(!prim[i]){
nr++;
for(j=2*i;j<=n;j+=i)
prim[j]=1;}
g<<nr;
return 0;
}