PYTHON3 - TASK2 day9

TASK

1.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.

PROGRAM:

coin=1
day=1
while day<=5:
    coin=coin*day
    day=day+1
print(coin) 

output:
120

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

PASSWORD:
ABCD, ABDC, ACBD, ACDB, ADBC, ADCB, BACD, BADC, BCAD, BCDA, BDAC, BDCA, CABD, CADB, CBAD, CBDA, CDAB, CDBA, DABC, DACB, DBAC, DBCA, DCAB, DCBA

1. 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

PROGRAM:

total=60
up=0
day=0
while up<total:
    up = up+2
    day=day+1
    up=up-0.5
print (up)
print (day)

output:

60.0
40

1. 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.

PROGRAM:

flowers = 1
temples = 0
while temples < 7:
    flowers = flowers * 2
    temples = temples + 1
print(flowers)

output:
128