Cod sursa(job #2116475)
Utilizator | Data | 27 ianuarie 2018 17:56:19 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <iostream>
#include <fstream>
using namespace std;
bool x[2000000];
int main()
{
ifstream in("ciur.in");
ofstream out("ciur.out");
int n,k=0;
in>>n;
for(int i=2;i<n;i++)
if(!x[i])
{
k++;
for(int j=i+i;j<n;j+=i)
x[j]=true;
}
out<<k;
return 0;
}