Cod sursa(job #1534966)
Utilizator | Data | 24 noiembrie 2015 08:57:04 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.3 kb |
#include <fstream>
using namespace std;
ifstream in ("ciur.in");
ofstream out ("ciur.out");
char ciur[2000000];
int main()
{
int x,N,d,i;
in>>N;
for (d=2;d*d<=N;d++)
if (ciur[d]==0)
for (i=d*d;i<=N;i=i+d)
ciur [i]=1;
out<<d;
return 0;
}