Cod sursa(job #656139)
Utilizator | Data | 3 ianuarie 2012 23:19:59 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int i,n,j,r;
bool p[2500000];
int main(){
f>>n;
for(i=2; i<=n; i++)
if(p[i]==0) {
for(j=i*i; j<=n; j+=i)
p[j]=1;}
for(i=2; i<=n; i++)
if(p[i]==0) r++;
g<<r<<'\n';
f.close();
g.close();
return 0;
}