Cod sursa(job #2146164)
Utilizator | Data | 27 februarie 2018 20:36:42 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include<fstream>
using namespace std;
short ciur[2000001];
int main()
{
//numere pana la 2000000
ifstream f("ciur.in");
ofstream g("ciur.out");
int n, i, j;
f>>n;
int k=0;
for (i=2; i*i<=n; i++)
if (ciur[i]==0)
{
k++;
for (j=2; j*i<=n; j++)
ciur[i*j]=1;
}
g<<k;
return 0;
}