There is a 100 storey building and you are provided with many identical eggs. What is the minimum no of eggs required to identify the maximum no of floors from where the eggs do not break if dropped from there? * code example

Example: egg floor code

#include<iostream> 
inline int f(int exp, int balls);

int f(int exp, int balls)
{   
    if(exp == 0 || balls == 0)
        return 0 ;

    return f(exp-1, balls)+ f(exp-1,balls-1)+1 ; 
}
int main()
{
    int experince{0};
    int balls {0};
    int floors {0};
    std::cout<<"Please enter the number of floors: ";
    std::cin>>floors;
    std::cout <<"\nPlease enter the number of balls: ";
    std::cin>>balls;

    while(true)
    {
        ++experince;
        if(f(experince,balls) >= floors)
            break;
    }

    std::cout<<"\nNumber experince required "<<experince<<std::endl;
    return 0 ;
}