Cod sursa(job #1317834)
Utilizator | Data | 15 ianuarie 2015 11:28:45 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include <iostream>
#include<fstream>
#define NMAX 2000005
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int main()
{
{char ciur[NMAX],n,i,nr=0;
f>>n;
for (i=2;i<n;i++)
{ if (ciur[i]==0)
{ nr++;
for(int k=i;k<=n;k=k+i)
ciur[k]=1;
}
}
}
g<<nr;
return 0;
}