Cod sursa(job #1009020)
Utilizator | Data | 12 octombrie 2013 13:13:27 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <fstream>
#include <cmath>
using namespace std;
int n, ok, i, j, ri, prime;
char v[2000010];
int main(){
ifstream fin("ciur.in");
ofstream fout("ciur.out");
fin>>n;
for (i=2;i<=n;i++) {
if (v[i] == 0) {
prime ++;
for (j=i+i;j<=n; j+=i)
v[j] = 1;
}
}
fout<<prime<<"\n";
return 0;
}