Cod sursa(job #1037535)
Utilizator | Data | 20 noiembrie 2013 12:50:06 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include<fstream>
using namespace std;
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
int n, i, j, sol;
char v[2000001], p[2000001];
int main() {
/*fin>>n;
d=0;
nrd=0;
for(i=1;i<=n;i++){
if(n%i==0){
d=1;
nrd=nrd+1;
}
}
fout<<nrd;*/
fin>>n;
for(i=2;i<=n;i++)
if(v[i]==0){
sol++;
p[sol]=i;
for(j=i+i;j<=n;j+=i)
v[j]=1;
}
fout<<sol;
return 0;
}