Cod sursa(job #2270342)
Utilizator | Data | 27 octombrie 2018 10:35:54 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
const int vm=2000001;
bool v[vm];
int i,n;
long long j;
int main()
{
int nr=0;
fin>>n;
for (i=2; i<=n; i++)
{
if(!v[i])
{
for (j=i*i; j<=n && j <= vm; j+=i)
v[j]=true;
nr++;
}
}
fout<<nr;
return 0;
}