Cod sursa(job #1932618)

Utilizator darian2001Clodnischi Darian Antonio darian2001 Data 19 martie 2017 22:19:45
Problema Ciurul lui Eratosthenes Scor 20
Compilator cpp Status done
Runda Arhiva educationala Marime 0.61 kb
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int main()
{
    int n,s=0,gasit;
    int nr[20000],nrs=0;
    f>>n;
    for(int i=3;i<=n;i+=2)
        for(int j=i*i;j<=n;j+=2*i)
            {
                gasit=false;
                for(int k=0;k<nrs&&gasit==false;k++)
                    if(nr[k]==j)
                        gasit=true;
                if(gasit==false)
                {
                    nr[nrs]=j;
                    nrs++;
                    s++;
                }
            }

    g<<n-(n/2)-s;
    f.close();
    g.close();
}