Jan 31, 2022

Java Program To Check Leap Year - Java Program Example

 Java Program to check Leap Year

Here we will write a java program to check whether the input year is a leap year or not. Before we see the program, lets see how to determine whether a year is a leap year mathematically:

To determine whether a year is a leap year, follow these steps:

1.     If the year is evenly divisible by 4, go to step 2. Otherwise, go to step 5.

2.     If the year is evenly divisible by 100, go to step 3. Otherwise, go to step 4.

3.     If the year is evenly divisible by 400, go to step 4. Otherwise, go to step 5.

4.     The year is a leap year (it has 366 days).

5.     The year is not a leap year (it has 365 days). Source of these steps.

Example: Program to check whether the input year is leap or not

Here we are using Scanner class to get the input from user and then we are using if-else statements to write the logic to check leap year. To understand this program, you should have the knowledge of following concepts of Core Java Tutorial:

 

Program Code

package com.androidpro.in;


import
java.util.Scanner;

public class
Main {
   
public static void main(String[] args) {
       
int year;
       
Scanner scan = new Scanner(System.in);
       
System.out.println("Enter any Year:");
       
year = scan.nextInt();
       
scan.close();
        boolean
isLeap = false;
        if
(year % 4 == 0)
        {
           
if( year % 100 == 0)
            {
               
if ( year % 400 == 0)
                    isLeap =
true;
                else
                   
isLeap = false;
           
}
           
else
               
isLeap = true;
       
}
       
else {
            isLeap =
false;
       
}
       
if(isLeap==true)
            System.
out.println(year + " is a Leap Year.");
        else
           
System.out.println(year + " is not a Leap Year.");
   
}

}


Output

Enter any Year: 2001 2001 is not a Leap Year. Enter any Year: 1996 1996 is a Leap Year. Process finished with exit code 0
Share:

0 Comments: