A year in the modern Gregorian Calendar consists of 365 days. In reality, the earth takes longer to rotate around the sun. To account for the difference in time, every 4 years, a leap year takes place. A leap year is when a year has 366 days: An extra day, February 29th. The requirements for a given year to be a leap year are 1) The year must be divisible by 4 2) If the year is a century year (1700, 1800, etc.), the year must be evenly divisible by 400 Some example leap years are 1600, 1712, and 2016. Write a program that takes in a year and determines whether that year is a leap year Ex: If the input is:

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
icon
Concept explainers
Question
10 Notecard - x
Study Guide for Final x
zy Section 4.19 - CS 101 X
O How to use ZyBook - X
Chapter 15 Powerpoi x
G
What was the purpos X +
i learn.zybooks.com/zybook/VALDOSTACS1010Fall2021/chapter/4/section/19
zyBooks My library > CS 1010: Algorithmic Problem Solving home > 4.19 LAB: Leap year
E zyBooks catalog e Help/FA
A year in the modern Gregorian Calendar consists of 365 days. In reality, the earth takes longer to rotate around the sun. To account for the
difference in time, every 4 years, a leap year takes place. A leap year is whena year has 366 days: An extra day, February 29th. The
requirements for a given year to be a leap year are:
1) The year must be divisible by 4
2) If the year is a century year (1700, 1800, etc.), the year must be evenly divisible by 400
Some example leap years are 1600, 1712, and 2016.
Write a program that takes in a year and determines whether that year is a leap year.
Ex: If the input is:
1712
the output is:
1712 - leap year
Ex If the input is:
1913
the output is:
1913 - not a leap year
P Type here to search
a
W
69*F
4.
of
"bt sc
40
144
44
delete
home
24
4.
96
5
&.
7\
%23
num
12
9.
backspace
lock
Q
E
R
T
Y
ho
H.
enter
D
G
pause
M
* shift
alt
ctrl
alt
B.
Transcribed Image Text:10 Notecard - x Study Guide for Final x zy Section 4.19 - CS 101 X O How to use ZyBook - X Chapter 15 Powerpoi x G What was the purpos X + i learn.zybooks.com/zybook/VALDOSTACS1010Fall2021/chapter/4/section/19 zyBooks My library > CS 1010: Algorithmic Problem Solving home > 4.19 LAB: Leap year E zyBooks catalog e Help/FA A year in the modern Gregorian Calendar consists of 365 days. In reality, the earth takes longer to rotate around the sun. To account for the difference in time, every 4 years, a leap year takes place. A leap year is whena year has 366 days: An extra day, February 29th. The requirements for a given year to be a leap year are: 1) The year must be divisible by 4 2) If the year is a century year (1700, 1800, etc.), the year must be evenly divisible by 400 Some example leap years are 1600, 1712, and 2016. Write a program that takes in a year and determines whether that year is a leap year. Ex: If the input is: 1712 the output is: 1712 - leap year Ex If the input is: 1913 the output is: 1913 - not a leap year P Type here to search a W 69*F 4. of "bt sc 40 144 44 delete home 24 4. 96 5 &. 7\ %23 num 12 9. backspace lock Q E R T Y ho H. enter D G pause M * shift alt ctrl alt B.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Control Structure
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education