Cod sursa(job #3152994)
Utilizator | Data | 27 septembrie 2023 16:07:28 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
int n;
bool t[2000001];
int main() {
in>>n;
t[0]=t[1]=true;
int c=0;
for(int i=2;i<=n;i++)
if(!t[i])
{
c++;
for(int j=2*i;j<=n;j+=i)
t[j]=true;
}
out<<c;
return 0;
}