Cod sursa(job #2523819)
Utilizator | Data | 14 ianuarie 2020 19:33:28 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
using namespace std;
ifstream in ("ciur.in");
ofstream out ("ciur.out");
bool ciur[2000001];
int main()
{
int i,j,n,s=0;
in>>n;
for(j=4;j<=n;j=j+2)
ciur[j]=1;
for(j=3;j<=n;j=j+2)
{
if(ciur[j]==0)
for(i=2;i*j<=n;i++)
ciur[i*j]=1;
}
if(n>=2)
s++;
for(i=3;i<=n;i=i+2)
{
if(ciur[i]==0)
s++;
}
out<<s;
return 0;
}