Cod sursa(job #863622)
Utilizator | Data | 23 ianuarie 2013 22:33:47 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
bool prim[20060000];
int n,k=0;
int main()
{
f>>n;
for(int i=2;i<=n;i++)
if( prim[i]==0)
for(int j=i*2;j<=n;j+=i)
prim[j]=1;
for(int i=2;i<=n;i++) if(prim[i]==0) k++;
g<<k;
f.close();
g.close();
return 0;
}