Cod sursa(job #2282348)
Utilizator | Data | 13 noiembrie 2018 17:25:18 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n,cnt;
short f[2000010];
void ciur() {
f[0]=1; f[1]=1;
for (int i=2;i<=n;i++) {
for (int j=2;j<=n/i;j++)
f[i*j]=1;
}
}
int main() {
fin>>n;
ciur();
for (int i=1;i<=n;i++) {
if (f[i]==0)
cnt++;
}
fout<<cnt;
return 0;
}