Cod sursa(job #1011031)
Utilizator | Data | 16 octombrie 2013 09:10:57 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in ("ciur.in");
ofstream out ("ciur.out");
int N;
bool p[2000000];
int main()
{
in>>N;
for (int i=2;i<=N;i++)
if (!p[i])
for (int j=2*i;j<=N;j=j+i)
p[j]=true;
int nr=0;
for (int i=2;i<=N;i++)
if (!p[i])
nr++;
out<<nr;
}