Cod sursa(job #3221528)
Utilizator | Data | 7 aprilie 2024 12:43:56 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bool a[2000001];
int main()
{
int n, k=0;
fin >> n;
for(int i=2; i<=n; i++)
{
if(a[i]==0)
{
for(int j=2; j*i<=n; i++)
{
a[i*j]=1;
}
}
}
for(int i=2; i<=n; i++)
{
if(a[i]!=0)k++;
}
fout << k;
}