Cod sursa(job #1029960)
Utilizator | Data | 15 noiembrie 2013 15:34:46 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
using namespace std;
int i,j,n,nrprime;
bool a[10000000];
ifstream f("ciur.in");
ofstream g("ciur.out");
int main()
{
f>>n;
for (i=1;i<=n;i++)
a[i]=true;
for (i=2;i<=n;i++)
if (a[i]==true){
nrprime++;
for (j=i+i;j<=n;j=j+i)
a[j]=false;
}
g<<nrprime;
f.close();
g.close();
}