此题为NOJ第1008题,关于闰年天数的判断和计算。
#include<iostream>
using namespace std;
bool IsLeapYear(int year){
if(( year%4==0 && year%100 !=0) || year%400==0)
return true;
else return false;
}
int ComputeDays(int year,int month,int day){
int LeapYear_Num=0;
int months[12]={31,28,31,30,31,30,31,31,30,31,30,31};
int days=day;
int SumDays;
for(int i=2000;i<year;i++){
if(IsLeapYear(i))
LeapYear_Num++;
}
if(IsLeapYear(year)){
months[1]=29;
}
for(int j=0;j<month-1;j++){
days+=months[j];
}
SumDays=365*(year-2000)+LeapYear_Num+days-1;
cout<<"2000年以来逝去 "<<SumDays<<" 天."<<endl<<"这一年的第 "<<days<<" 天"<<endl;
return 0;
}
int main (){
int year,month,day;
cout<<"输入年月日(如:1991 1 1):";
cin>>year>>month>>day;
ComputeDays(year,month,day);
return 0;
}