Cod sursa(job #2246620)

Utilizator Cpt.TropicalOlaru Valentin Alexandru Cpt.Tropical Data 27 septembrie 2018 11:44:42
Problema Ciurul lui Eratosthenes Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.51 kb
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
int a[1000001],k,n,b[1000001],k2=0;
int main()
{
    for(int i=2;i<1000001;++i)
        if(a[i]==0)
    {
        b[k]=i;
        k++;
        for(int j=i+i;j<1000001;j+=i)
        {
            a[j]=1;
        }
    }
    fin>>n;
    for(int i=0;i<=n;++i)
        for(int j=0;j<=k;++j)
        if(b[j]==i)
    {
        j=k+1;
        k2++;
    }
    fout<<k2-1;
    return 0;
}