PYTHON TASK - LOOPS3

8) A king announces a unique reward for Hard Workers. On each day, the reward is multiplied by the day's number. The reward starts at 1 gold coin. Given the number of days n, write a program to calculate the final reward.
2 = 2 * 1
3 = 3 * 2 * 1
4 = 4 * 3 * 2 * 1

n = int(input('Enter total number of days: '))
days = 1
coin = 1
while days<=n:
    coin *= days
    days += 1
print ('The final reward = ',coin)

Output:
Enter total number of days: 5
The final reward = 120

*9) Suppose a password consists of the letters:
A, B. Each letter must be used exactly once. How many different passwords are possible?
ABCD, ABDC, ACBD, ACDB, ADBC, ADCB, BACD, BADC, BCAD, BCDA, BDAC, BDCA, CABD, CADB, CBAD, CBDA, CDAB, CDBA, DABC, DACB, DBAC, DBCA, DCAB, DCBA
*

n = 4
possible = 1
while n>=1:
    possible *= n
    n-=1
print(possible)

Output:
24

**10)Frog in a Well
A frog accidentally falls into a 60-foot-deep well.
Every day:

• During the day, the frog climbs 2 feet.
• During the night, it slips down 0.5 feet.

This pattern continues every day until the frog reaches the top of the well and escapes.

Write a program to determine:

1. How many days it takes for the frog to get out of the well.
2. On which day the frog escapes. ** Note: Once the frog reaches or crosses the top of the well during the daytime, it escapes immediately and does not slip back that night.

total_foot = 60
up = 2
down = 0.5
days = 0
while total_foot>0:
    total_foot -= up
    total_foot += down
    days +=1
print('Total number of days taken = ',days)
print('The day frog reached = ',days)

Output:
Total number of days taken = 40
The day frog reached = 40

**11)The Saint's Flower Basket

A saint goes for a morning walk every day. During his walk, he plucks flowers and keeps them in a basket. On his way back home, he visits 7 temples. At each temple, he offers half of the flowers currently in his basket.

After visiting all 7 temples, he reaches home with exactly one flower remaining in his basket.

final(after)

1

Write a program to determine how many flowers the saint had in his basket before he visited the first temple.
**
Hint: Think carefully about whether it is easier to solve the problem from the beginning or by working backwards from the final flower.

flower_basket = 1
temple = 7
while temple > 0:
    flower_basket *= 2
    temple -= 1
print ('Flowers the saint had in his basket before he visited the first temple:',flower_basket)

Output:
Flowers the saint had in his basket before he visited the first temple: 128