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