Cod sursa(job #1541874)
Utilizator | Data | 4 decembrie 2015 17:20:36 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <fstream>
using namespace std;
ifstream in("ciur2.in");
ofstream out("ciur2.out");
bool v[2000001], v2[1000000];
int gg;
int main()
{int n, i, j;
in>>n;
for (i=2; i<=n; i++){
if (v[i]==0){
gg++;
for (j=i*2; j<=n; j+=i){
v[j]=1;
}
}
}
out<<gg;
return 0;
}