POJ2080-Calendar

http://poj.org/problem?id=2080

耐心,注意细节。

#include<iostream>
#include<string>
using namespace std;
string week[]={"Saturday","Sunday","Monday","Tuesday","Wednesday","Thursday","Friday"};
int day[]={0,31,28,31,30,31,30,31,31,30,31,30,31};
bool isleap(int &year)
{
    if(year%4==0&&year%100!=0||year%400==0) 
       return true;
    else 
       return false;
}
int maxday(int &year)
{
    if(isleap(year)) 
       return 366;
    else 
       return 365;
}
int getyear(int &days)
{
    int year=2000;
    while(days>maxday(year))
    {
        days-=maxday(year);
        year++;
    }
    return year;
}
int getmonth(int year,int &days)
{
    int month=1;
    if(isleap(year)) 
       day[2]=29;
    else 
       day[2]=28;
    while(days>day[month])
    {
        days-=day[month];
        month++;
    }
    return month;
}
int getday(int &days)
{
    return days;
}
string getweek(int &days)
{
    return week[days%7];
}
int main(void)
{
    int days,y,m,d;
    string wk;
    while(cin>>days&&days!=-1)
    {
        wk=getweek(days);
        days++;
        y=getyear(days);
        m=getmonth(y,days);
        d=getday(days);
        cout<<y<<"-";
        if(m<10)
           cout<<0;
        cout<<m<<"-";
        if(d<10) 
          cout<<0;
        cout<<d<<" "<<wk<<endl;
    }
    return 0;
}

转载于:https://www.cnblogs.com/YogurtShen/archive/2012/08/28/2660960.html

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值