HomeVolumesContestsSectionsForumsUsersPrintHelpAbout

Volumes > Chapter 2. Decision structures > problem:


04. Leap Year

Volume problems

• 01. a
• 02. Sign
• 04. Leap Year
• 05. Find the biggest 2
• 06. Find the biggest 3
• 1. a

Feedback

If you notice incorrect translations in Contester, please let author know.

Time limit 200/200/4000/4000 ms. Memory limit 65000/65000/65000/65000 Kb.

Leap years are years with an extra day (February 29); this happens almost every four years. Generally, leap years are divisible by four, but century years are special, they must also be divisible by 400. Given a year decide whether it is a leap year or not.

Input: An integer for year value.

Output: "IT IS A LEAP YEAR" or "IT IS NOT A LEAP YEAR".

cin
cout
1988 IT IS A LEAP YEAR
1989 IT IS NOT A LEAP YEAR
1900 IT IS NOT A LEAP YEAR
2000 IT IS A LEAP YEAR
Для отправки решений необходимо выполнить вход.

www.contester.ru