Answer:
def leap_year(y):
if y % 4 == 0:
return 1
else:
return 0
def number_of_days(m,y):
if m == 2:
return 28 + leap_year(y)
elif m == 1 or m == 3 or m == 5 or m == 7 or m == 8 or m ==10 or m == 12:
return 31
elif m == 4 or m == 6 or m == 9 or m == 11:
return 30
def days(m,d):
if m == 1:
return 0 + d
if m == 2:
return 31 + d
if m == 3:
return 59 + d
if m == 4:
return 90 + d
if m == 5:
return 120 + d
if m == 6:
return 151 + d
if m == 7:
return 181 + d
if m == 8:
return 212 + d
if m == 9:
return 243 + d
if m == 10:
return 273 + d
if m == 11:
return 304 + d
if m == 12:
return 334 + d
def days_left(d,m,y):
if days(m,d) <= 60:
return 365 - days(m,d) + leap_year(y)
else:
return 365 - days(m,d)
print("Please enter a date")
day=int(input("Day: "))
month=int(input("Month: "))
year=int(input("Year: "))
choice=int(input("Menu:\n1) Calculate the number of days in the given month.\n2) Calculate the number of days left in the given year.\n"))
if choice == 1:
print(number_of_days(month, year))
if choice == 2:
print(days_left(day,month,year))
Explanation:
Hoped this helped
Answer:
He relocated from Mecca to the city of Medina.
Explanation:
Your answer is such a genius. :)
Answer:
Both are correct.
Explanation:
Both technicians are correct in this scenario. Technician A point of view is correct as well as technician B.
Answer:
D.Indirect Recursion.
Explanation:
Indirect recursion is when a method calls other method which calls the original method again.
For example:-
public static int mthd1( int n)
{
if (n == 0)
return 0;
else
return (mthd2(n-1));
}
public static int mthd2(int n2)
{ return mthd1( n2-1); }
This is an example of indirect recursion.Where mthd1 calls mthd 2 and mthd 2 calls mthd 1 again.
