Cod sursa(job #2377508)

Utilizator McFan66Tudorache Stefan McFan66 Data 10 martie 2019 14:01:20
Problema Ciurul lui Eratosthenes Scor 30
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.61 kb
#include <iostream>
#include <fstream>
using namespace std;

int main()
{

    ifstream f("ciur.in");
    ofstream g("ciur.out");
    int n;
    f>>n;
    int A[n],B[n];
    for(int i=0;i<n;i++)
        A[i]=1;
    int k=0;
    int c=0;
    int st;
    int j;
    for(int i=2;i<n;i++){
        if(A[i]==1){
            B[k]=i;
            j=i;
            st=j;
            c++;
            while(j<=n){
                if(j%B[k]==0)
                    A[j]=0;
                j+=st;
            }
            k++;
        }
    }
    g<<c;
    g.close();
    f.close();
    return 0;
}