Difference between revisions of "Leap Year Problem"
Line 1: | Line 1: | ||
{{1010PrAD | {{1010PrAD | ||
|ProblemName=Leap Year Problem | |ProblemName=Leap Year Problem | ||
− | |Problem=Write a short program that takes a year as input from the user, and then determines whether or not that particular year is (or was) | + | |Problem=Write a short program that takes a year as input from the user, and then determines whether or not that particular year is (or was) a leap year.<BR /><BR /> |
− | + | As a reminder, here is the criteria that dictates whether or not a year is a leap year: If the year is evenly divisible by 4, then the year is a leap year -- unless it is also divisible by 100, in which case it is not. An exception to this is if the year is divisible by 400, then it is still a leap year.<BR /><BR /> | |
− | 1996 was a leap year because it was divisible by 4.<BR> | + | |
+ | Examples:<BR> | ||
+ | 1996 was a leap year because it was divisible by 4.<BR /> | ||
1900 was not a leap year in spite of being divisible by 4, because it is also divisible by 100.<BR> | 1900 was not a leap year in spite of being divisible by 4, because it is also divisible by 100.<BR> | ||
− | 2000 was a leap year because it is divisible by 400.<BR> | + | 2000 was a leap year because it is divisible by 400.<BR /> |
2009 was not a leap year, because it is not divisible by 4. | 2009 was not a leap year, because it is not divisible by 4. | ||
Revision as of 23:11, 5 April 2010
Back to the Program-A-Day homepage
ProblemWrite a short program that takes a year as input from the user, and then determines whether or not that particular year is (or was) a leap year. As a reminder, here is the criteria that dictates whether or not a year is a leap year: If the year is evenly divisible by 4, then the year is a leap year -- unless it is also divisible by 100, in which case it is not. An exception to this is if the year is divisible by 400, then it is still a leap year. Examples: |
SideSectionTitle
An image or By Students section | |
---|---|---|
SolutionThe solution... | ||
Code |