Cod sursa(job #2419645)
Utilizator | Data | 9 mai 2019 08:48:45 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 70 |
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],n,i,j,k=0;
int main()
{
f>>n;
for(i=2;i<=n;i++) ciur[i]=1;
for(i=2;i*i<=n;i++)
if(ciur[i]) for(j=2;i*j<=n;j++)
ciur[i*j]=0;
for(i=2;i<=n;i++)
{
if(ciur[i]) k++;
}
g<<k;
g.close();
return 0;
}