C Program to Check Year is a Leap Year or Not

How to Check Year is a Leap Year or Not in C:-

In this program we have to find the year is a leap year or not. Generally we assume that year is exactly divisible by 4 is a leap year. But it is not only in this case 1900 is divisible by 4. But it is not a leap so it that case we follows these conditions

It is exactly divisible by 100
If it is divisible by 100, then it should also exactly divisible by 4
And it is divisible by 400

These all conditions are true year is a leap year.

ALGORITHMS:-

Step 1. Initialize variable “year” to find leap year.

Step 2. Take input from User.

Step 3. We use this condition ((year%4==0)&& (year%100!=0)) || (year%400==0)) to check the year is Leap or not.

Step 4. It is true display year is a leap year.

Step 5. It is false display year is not a leap year.

Step 6. Stop.

CODE: -

#include<stdio.h>
int main()
{
    int year;
    printf("Enter any year: ");
    scanf("%d",&year);
    if(((year%100!=0)&&(year%4==0))||(year%400==0))
    {
        printf("year is leap year");
    }
    else
    {
        printf("Year is not a leap year");
    }
    return 0;
}



OUTPUT:-


FOLLOW AND SUBSCRIBE THIS WEBPAGE FOR MORE NEW PROGRAMS AND CODING SOLUTIONS.

Comments

Data Structure Multiple Choice Questions and Answers

Data Structure Multiple Choice Questions and Answers Our 1000+ multiple choice questions and answers (MCQs) on "Data Structure - I" (along with 1000+ MCQs on "Data Structure - II (Algorithms)") focus on all areas of Data Structure covering 200+ topics. One can read MCQs on Data Structure - II (Algorithms) Array and Array Operations This set of Data Structure Multiple Choice Questions & Answers (MCQs) focuses on “Array and Array Operations”. 1. Which of these best describes an array? a) A data structure that shows a hierarchical behavior b) Container of objects of similar types c) Arrays are immutable once initialised d) Array is not a data structure View Answer Answer: b Explanation: Array contains elements only of the same type. 2. How do you initialize an array in C? a) int arr[3] = (1,2,3); b) int arr(3) = {1,2,3}; c) int arr[3] = {1,2,3}; d) int arr(3) = (1,2,3); View Answer Answer: c Explanation: This is the syntax ...

HackerRank Tuples Solution in Python

HackerRank Tuples Solution in Python Task Given an integer,n, and n space-separated integers as input, create a tuple, t, of those n integers. Then compute and print the result of hash(t). Note: hash() is one of the functions in the __builtins__ module, so it need not be imported. Input Format The first line contains an integer,n, denoting the number of elements in the tuple. The second line contains n space-separated integers describing the elements in tuple t . Output Format Print the result of hash(t) . Sample Input 0 2 1 2 Sample OUTPUT- 3713081631934410656 n = int(input()) int_list = [int(i) for i in input().split()] int_tuple = tuple(int_list) print(hash(int_tuple))

Chakra Vyuh Bhedna, the only answer to how to crack group discussions!

Chakra Vyuh Bhedna, the only answer to how to crack group discussions! Because of the pandemic, the placement drive was conducted virtually. And to add to the difficulty level, more than 200 students participated in the drive. The selection process consisted of an online test that included the aptitude and technical questions, which was followed by a group discussion. Both were elimination rounds. The shortlisted students were then called for the final round, the personal interview. All about cracking group discussions and interviews My strategy was to be attentive in the pre-placement talks by asking questions to them and even trying to answer their questions. This helped me to boost my self-confidence and made me perform well during the Group Discussion. For cracking group discussion, I practiced a simple and powerful technique called Chakra Vyuh Bhedna . It's a complete weapon to crack any GD. This technique has 4 parts. Awareness of the topic Understanding PE...

Code_with_chandan

Search This Blog