long getNumWithXZero(long n)    //creaza un numar ce este egal cu 1 urmat atatea zerouri cate cifre are numarul:
{                               //Ex : 665 = 3 cifre =>  1 000 (1 + 3 zerouri dupa)
    if(n == 0)
        return 1;
    return 10 * getNumWithXZero(n / 10);
}

bool checkNumForSucc(long n, int succNum)   //cauta in N pe succNum
{
    long divNum = getNumWithXZero(succNum);

    while(n)
    {
        if(n%divNum == succNum)
            return true;

        n/=10;
    }
    return false;
}

void Probl3(long arrayNumbers[], int succNum, int arrayLen) //parcuge vectorul si afiseaza rezultatele
{
    for(int i = 0 ; i < arrayLen ; i++ )
        if(checkNumForSucc(arrayNumbers[i], succNum))
            cout << arrayNumbers[i] << endl;
}