Cod sursa(job #2721681)
Utilizator | Data | 12 martie 2021 09:08:36 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int ciur[2000001],i,n,k,j;
int main()
{
f>>n;
ciur[1]=1;
for(i=2;i<=n;i++)
{
if(ciur[i]==0)
{
for(j=i*2;j<=n;j+=i)
ciur[j]=1;
}
}
for(i=1;i<=n;i++)
if(ciur[i]==0)k++;
g<<k;
f.close();
g.close();
return 0;
}