Question: Zeller?s congruence is an algorithm developed by Christian Zeller to calculate the day of the week. The formula is where ? h is the day
Zeller?s congruence is an algorithm developed by Christian Zeller to calculate the day of the week. The formula is

where
? h is the day of the week (0: Saturday, 1: Sunday, 2: Monday, 3: Tuesday, 4: Wednesday, 5: Thursday, 6: Friday).
? q is the day of the month.
? m is the month (3: March, 4: April, ?, 12: December). January and February are counted as months 13 and 14 of the previous year.
? j is the century (i.e.,year/100).
? k is the year of the century (i.e., year % 100).
Note that the division in the formula performs an integer division. Write a program that prompts the user to enter a year, month, and day of the month, and displays the name of the day of the week. Here are some sample runs:

January and February are counted as 13 and 14 in the formula, so you need to convert the user input 1 to 13 and 2 to 14 for the month and change the year to the previous year. ? ?
26(m + 1) (4+ +k + - + + 5j % 7 10 || Enter year: (e.g., 2012): 2015 JEnter Enter month: 1-12: 1 - Enter Enter the day of the month: 1-31: 25 JEmer Day of the week is Sunday Enter year: (e.g., 2012): 2012 JEnter Enter month: 1-12: 5 Enter Enter the day of the month: 1-31: 12 JEnter Day of the week is Saturday
Step by Step Solution
3.33 Rating (168 Votes )
There are 3 Steps involved in it
Program plan Declare variables h q m year of type int Prompt and read ... View full answer
Get step-by-step solutions from verified subject matter experts
