In python:
age = float(input("How old are you? "))
weight = float(input("How much do you weigh? "))
heart_rate = float(input("What's your heart rate? "))
time = float(input("What's the time? "))
print("The calories burned for men is {}, and the calories burned for women is {}.".format(
((age * 0.2017) - (weight * 0.09036) + (heart_rate * 0.6309) - 55.0969) * (time / 4.184),
((age * 0.074) - (weight * 0.05741) + (heart_rate * 0.4472) - 20.4022) * (time / 4.184)))
This is the program.
When you enter 49 155 148 60, the output is:
The calories burned for men is 489.77724665391963, and the calories burned for women is 580.939531548757.
Round to whatever you desire.
Answer:
Stack.
Explanation:
Topological sort requires a bit of addition to DFS algorithm.So DFS can be done by two ways that are either you can use recursion or you can use Stack data structure to implement DFS.
Since recursion uses stack memory when it makes recursive calls and if you want to do it iteratively you can stack data structure.
Answer:
Im pretty sure Domain name system but dont trust me
Explanation:
Answer:
<h3>Norman only likes to stuff birds, not other animals.</h3>
