Cod sursa(job #656948)
Utilizator | Data | 5 ianuarie 2012 15:51:39 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | winners6 | Marime | 0.3 kb |
#include <fstream>
using namespace std;
int main()
{
int i,nr=0,n,j;
char ciur[2000001];
ifstream fin("ciur.in");
ofstream fout("ciur.out");
fin>>n;
for(i=2; i<=n; i++)
{
if (ciur[i]==0)
{nr ++;
for (j=i+i;j<=n;j=j+i)
ciur[j]=1; } }
fout<<nr;
fin.close();
fout.close();
return 0;
}