Cod sursa(job #944135)
Utilizator | Data | 27 aprilie 2013 15:20:23 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <iostream>
#include <fstream>
#define nmax 1000005
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
int n,v[nmax],k=0;
void ciur(){
for (int i=2; i<=n; i++) {
if (v[i]==0) {
k++;
for (int j=2*i; j<=n; j+=i) v[j]=1;
}
}
out << k;
}
int main()
{
in >> n;
ciur();
return 0;
}