Cod sursa(job #3132738)
Utilizator | Data | 23 mai 2023 18:53:51 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 70 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n, ciur[2000000],ct=0;
int main()
{
fin >> n;
for (int i=2; i<=n; ++i) {
if (ciur[i]==0) {
for (int j=2*i; j<=n; j=j+i) {
ciur[j]=1;
}
}
}
for (int i=2; i<=n; ++i) {
if (ciur[i]==0) {
ct++;
}
}
fout << ct;
return 0;
}