Cod sursa(job #3159528)
Utilizator | Data | 21 octombrie 2023 15:32:55 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
int n, db=0;
ifstream f("ciur.in");
f>>n;
int t[2000001];
for (int i=1; i<=n; i++)
{
t[i]=i;
}
for (int i=2; i<=n; i++)
{
if(t[i]!=0)
{
for (int j=2; j*i<=n; j++)
{
t[j*i]=0;
}
db++;
}
}
cout << db;
return 0;
}