Cod sursa(job #728067)
Utilizator | Data | 28 martie 2012 14:31:03 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include <fstream>
using namespace std;
int main(){
long n,i,np=0;
char c[2000001];
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
for(i=2;i<=n;i++)
c[i]=1;
for(i=2;i<=n;i++)
if(c[i]){
np++;
for(long j=i+i;j<=n;j=j+i)
c[j]=0;}
g<<np;
f.close();
g.close();
return 0;}