Cod sursa(job #1290837)
Utilizator | Data | 11 decembrie 2014 20:30:01 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int p[200000];
int main()
{
int N;
int x=0, ct=0, i, j;
fin>>N;
for(i=2; i<=N; i++)
{
p[i] = i;
}
for(i=2; i<=N; i++)
{
if(p[i] != 0)
{
x++;
for(j=i; j<=N; j+=i)
{
p[j] = 0;
}
}
}
fout << x;
return 0;
}