Cod sursa(job #630519)
Utilizator | Data | 5 noiembrie 2011 17:58:16 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{int nr,i,j,n;
char v[2000000];
ifstream f ("ciur.in");
ofstream g ("ciur.out");
f>>n;
for (i=1;i<=n;i++){
v[i]=1;}
i=2;
nr=0;
while (i!=n){
if (v[i]==1) {
nr=nr+1;
j=i;
while (j<=n){
v[j]=0;
j=j+i;}
}
i=i+1;
}
g<<nr;
return 0;
}