Skip to main content

C Program To Find Leap Years.

In the Gregorian calendar (the current standard calendar in the world), normally the years that are integer multiples of 4 are called leap years. In each leap year, the month of February has 29 days instead of 28. Adding an extra day to the calendar every four years compensates for the fact that a period of 365 days is shorter than a solar year by almost 6 hours. The Gregorian calendar was first used in 1582.

Some exceptions to this basic rule are required since the duration of a solar year is slightly less than 365.25 days. Over a period of 4 centuries, the accumulated error of adding a leap day every 4 years amounts to about 3 extra days. The Gregorian calendar therefore omits 3 leap days every 400 years, which is the length of its leap cycle. This is done by omitting February 29 in the 3 century years (integer multiples of 100) that are not also integer multiples of 400. For example, 1700, 1800, 1900, 2100 and 2200 are common years, but 1600, 2000 and 2400 are leap years. By this rule, the average number of days per year is 365 + 1/4 − 1/100 + 1/400 = 365.2425.

There is no year 0. The first year in the Gregorian calendar is year 1. The year before 1AD in the western calendar is 1BC, not "year 0".

Method 1:
#include <stdio.h>
int main() {

int year;
printf(" Enter a year: ");
scanf("%d", &year);

while ( year <= 0) {
printf("\n\nWrong Input! The Gregorian Calendar Starts with Year 1.\n\n");
return 0;
}

while ( year > 0) {

if ( year%400 == 0)
printf("\n\n %d is a leap year.\n\n", year);
else if ( year%100 == 0)
printf("%\n\n %d is not a leap year.\n\n", year);
else if ( year%4 == 0 )
printf("\n\n %d is a leap year.\n\n", year);

else
printf("\n\n %d is not a leap year.\n\n", year);
return 0;
}}

Method 2:
#include<stdio.h>
int main() {

int year;
printf(" Enter any year: ");
scanf("%d",&year);

while ( year <= 0) {
printf("\n\nWrong Input! The Gregorian Calendar Starts with Year 1.\n\n");
return 0;
}

while ( year > 0) {
if(((year%4==0)&&(year%100!=0))||(year%400==0))
printf("\n\n %d is a leap year.\n\n",year);
else
printf("\n\n %d is not a leap year.\n\n",year);
return 0;
}}

Method 3: Find the leap years between a given year range
#include<stdio.h>
int main(){

int year;
int min_year,max_year;
printf("\n\n Enter the lowest year: ");
scanf("%d",&min_year);
printf("\n\n Enter the highest year: ");
scanf("%d",&max_year);

if (( min_year < 1)||(max_year <1)) {
printf("\n\nWrong Input! The Gregorian Calendar Starts with Year 1.\n\n");
return 0;
}

if ( min_year > max_year) {
printf("\n\n Wrong Input!\n\n");
return 0;
}
printf("\n\n Leap years in the given range are: ");

for(year = min_year;year <= max_year; year++){
if(((year%4==0)&&(year%100!=0))||(year%400==0))
printf("%d ",year);
}
printf("\n\n");
return 0;
}

Popular posts from this blog

Screenshots from Windows 1.01

Windows 1.0 is a graphical personal computer operating environment developed by Microsoft, released on November 20, 1985, as the first version of the Microsoft Windows line. Version 1.01 , also released in 1985, was the first point-release after Windows 1.00.   Screenshots from Windows 1.01: ⇰ Desktop  First Run Empty Desktop Desktop With Applications ⇰  Office Applications Notepad Text Editor Calculator Calendar Clock Address Book ⇰  Multimedia Applications Media player, CD player, Volume level, and Sound: This GUI doesn’t have these features. ⇰  Networking Applications Terminal Phone Dialer: This GUI doesn’t have this feature. ⇰  Internet Applications Browser, and Mail: This GUI doesn’t have these features. ⇰  Accessibility Applications Keyboard Map:  This GUI doesn’t have this feature. ⇰  Settings Desktop themes,  Display,  S...

Introduction To Algorithms, 3rd Edition

Before there were computers, there were algorithms. But now that there are computers, there are even more algorithms, and algorithms lie at the heart of computing. This book provides a comprehensive introduction to the modern study of computer algorithms. It presents many algorithms and covers them in considerable depth, yet makes their design and analysis accessible to all levels of readers. In this book, the authors tried to keep explanations elementary without sacrificing depth of coverage or mathematical rigor. Each chapter presents an algorithm, a design technique, an application area, or a related topic. Algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The book contains 244 figures — many with multiple parts — illustrating how the algorithms work. It also includes careful analysis of the running times of all algorithms. In this third edition, the entire book once again updated including changes cove...

C++ Program To Implement Casino Number Guessing Game.

#include <iostream> #include <string> #include <cstdlib> #include <ctime> using namespace std; void drawLine(int n, char symbol); void rules(); int main() { string playerName; int amount; int bettingAmount; int guess; int dice; char choice; srand(time(0)); drawLine(70,'_'); cout << "\n\n\n\t\tCASINO GAME\n\n\n\n"; drawLine(70,'_'); cout << "\n\nEnter Your Name : "; getline(cin, playerName); cout << "\n\nEnter Deposit Amount To Play Game : $"; cin >> amount;

Java: The Complete Reference, 9th Edition

This is Herb's most popular book on Java, fully updated and expanded to cover Java SE 8 (JDK 8).    Whether you're an experienced pro or just starting out, this one-stop guide will help you master this important language.  Inside you'll find comprehensive coverage of the Java language, its keywords, syntax, and fundamental programming principles.  Of course, descriptions of Java's newest features, such as lambda expressions, default interface methods, and the stream API are included. This lasting resource also describes key elements of the Java API library, such as the Collections Framework, concurrency, applets, servlets, Beans, event handling,  AWT,  Swing, and more. Coverage of JavaFX, Java's newest GUI framework, is also included. *** TO REVIEW BOOK ***  (click below) *** TO REVIEW SOURCE CODE PROBLEM  SOLUTIONS, VISIT   THIS   LINK ***