Cod sursa(job #2495331)
Utilizator | Data | 19 noiembrie 2019 10:10:30 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <fstream>
using namespace std;
int p[2000001], i, j, n, sol;
int main ()
{
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
fin>>n;
p[2]=0;
for (i=2; i<=n; i++)
if (p[i]==0)
{
sol++;
for (j=2*i; j<=n; j+=i)
p[j]=1;
}
fout<<sol;
}