Cod sursa(job #3162087)
Utilizator | Data | 28 octombrie 2023 12:40:57 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <iostream>
#include <fstream>
using namespace std;
bool t[2000001];
int main()
{
int n, db=0;
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
for (int i=1; i<=n; i++)
{
t[i]=1;
}
for (int i=2; i<=n; i++)
{
if(t[i]!=0)
{
for (int j=2; j*i<=n; j++)
{
t[j*i]=0;
}
db++;
}
}
g<<db;
f.close();
g.close();
return 0;
}