Python

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.

n = int(input("Enter number of days: "))
reward = 1
day = 1
while day <= n:
    reward= reward * day
    day = day + 1
print("Final reward:", reward)

Output:Enter number of days: 5
Final reward: 120

9)Suppose a password consists of the letters:
A, B, C, D. Each letter must be used exactly once. How many different passwords are possible?

n = 4
result = 1

while n > 0:
    result = result * n
    n = n - 1
print("Number of different passwords:", result)

Output:Number of different passwords: 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=60
up=0
day=0
while up<total:
    up=up+2
    day=day+1
    up=up-0.5
print("escape day:",day)

Output:escape day: 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.

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.

After Temple 7 → 1
Before Temple 7 → 2

After Temple 6 → 2
Before Temple 6 → 4

After Temple 5 → 4
Before Temple 5 → 8

After Temple 4 → 8
Before Temple 4 → 16

After Temple 3 → 16
Before Temple 3 → 32

After Temple 2 → 32
Before Temple 2 → 64

After Temple 1 → 64
Before Temple 1 → 128

flower= 1
temple = 7

while temple > 0:
    flower = flower * 2
    temple = temple - 1
print("At first temple:", flower)

Output:At first temple: 128