Cod sursa(job #1976471)
Utilizator | Data | 3 mai 2017 15:14:57 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
bool ciur[2000000001];
int main()
{
int d,i,n;
in>>n;
for(d=2;d<=n;d++)
{
if(ciur[,d]==0)
{
for(i=d*2;i<=n;i+=d)
ciur(i)=1;
out<<d;
return 0;
}