Cod sursa(job #2411760)
Utilizator | Data | 21 aprilie 2019 11:29:58 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n, ciur[2000001], c;
void eratostene(int n)
{
for (int i=2;i<=n;i++)
{
if (ciur[i]==0)
{
c++;
for (int j=i*i;j<=n;j+=i)
ciur[j]=1;
}
}
}
int main()
{
fin>>n;
eratostene(n);
fout<<c;
return 0;
}