Cod sursa(job #2246631)
Utilizator | Data | 27 septembrie 2018 11:49:55 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
using namespace std;
bool ciur[2000005];
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,i,j,c=0;
f>>n;
for(i=3;i<=n;i+=2)
if(ciur[i]==0)
for(j=i*i;j<=n;j+=2*i)
ciur[j]=1;
for(i=4;i<=n;i+=2)
ciur[i]=1;
ciur[1]=1;
for(i=1;i<=n;i++)
if(ciur[i]==0)
c++;
g<<c;
return 0;
}