/* 17 Elefants by Oma Falk you might know the story so I tell it short: A man had 17 Elefants and three sons a, b, c. After his dead the elefants should go to a 1/2, b 1/3 and c 1/9. They wanted to keep elefants alive and asked a wise man. He had one elefant, added it and now: a got 9 🐘 b got 6 🐘 c got 2 🐘 and the wise man got back his 🐘 so far... And now it is up to you: Given three fractions a, b, c with a+b+c <1 Given a number of elefants e Given a wise man with always enough 🐘🐘🐘🐘🐘🐘. Is there always a solution? Maybe the wise man could get support by a prog that gives the answer and if possible the procedure how to solve. */ #include #include using namespace std; int main() { //The first two input can be split, the third leaves a poorer (no doubt wiser) man //int e=17, a=2, b=3,c=9; int e=25, a=3, b=4,c=5; //int e=16, a=2, b=3,c=9; srand(time(NULL)); cout<<"Please, input number of elephants and 3 denominators"<>e>>a>>b>>c; cout<<"\nWise "<<((rand()%2)?"wo":"")<<"man, please, can you help us assign elephants?"<1){ cout<<"No way! You want to share more elephants then you have and I am not parting with dear Teckel"<

camels