Cod sursa(job #2367293)
Utilizator | Data | 5 martie 2019 09:58:17 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("ciur.in");
ofstream g ("ciur.out");
bool oszto[2000000]={1,1,0};
int main()
{
int n,db=0;
f>>n;
for(int i=2;i*i<=n;i++)
if(oszto[i]==0)
for(int j=2;j<=n/i;j++)
oszto[i*j]=1;
for(int i=2;i<n;i++)
if(oszto[i]==0)
db++;
g<<db;
return 0;
}