Cod sursa(job #1463450)
Utilizator | Data | 20 iulie 2015 23:18:52 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
using namespace std;
int a[2000010];
int main()
{
int n,i,j,k=-1;
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
fin>>n;
for (i = 2; i <= n;i++)
a[i] = 1;
for (i = 2;i <= n;i++)
if (a[i])
{
k++;
for (j = j*2;j <= n;j += i)
a[j] = 0;
}
fout<<k;
return 0;
}