山东科技大学OJ题库 1101 一年中的第几天

1101 一年中的第几天

Description
给出某个日期，判断这是当年的第几天，每年的1月1日是第1天，非闰年年份的12月31日是第365天。

Input
输入的第一个数为n，后接n个日期。日期用3个正整数按顺序表示年月日，中间用“-”连接。

Output
若输入的日期为错误，则输出“error date!”；否则输出这个日期是本年的第几天。每个日期对应一行输出。

Sample Input
9
2010-01-01
2010-06-22
2010-12-31
2011-02-29
2011-07-18
2011-12-02
2012-02-29
2012-09-31
2012-12-31

Sample Output
1
173
365
error date!
199
336
60
error date!
366

HINT
抽象出判断闰年和判断日期合法性的两个函数，能够大大降低程序设计过程中的思维复杂程度。

#include<stdio.h>
int panduan(int a)
{
    if(a%100==0&&a%400==0)
       return 1;
    if(a%100!=0&&a%4==0)
       return 1;
    if(a%4!=0||a%100==0&&a%400!=0)
       return 0;
}
int main()
{
    int n,a,b,c,i;
    scanf("%d\n",&n);
    for(i=0;i<n;i++)
    {
        scanf("%d-%d-%d",&a,&b,&c);
        if(b<1||b>12)
            {
                printf("error date!\n");
                continue;
            }
        if(b==1||b==3||b==5||b==7||b==8||b==10||b==12)
        {
            if(c<1||c>31)
                {
                    printf("error date!\n");
                    continue;
                }
        }
        if(b==4||b==6||b==9||b==11)
        {
            if(c<1||c>30)
                {
                    printf("error date!\n");
                    continue;
                }
        }
        if(panduan(a)==0)
        {
            if(b==2)
            {
                if(c<1||c>28)
                    {
                        printf("error date!\n");
                        continue;
                    }
            }
            switch(b)
            {
                case 1:printf("%d\n",c);continue;
                case 2:printf("%d\n",31+c);continue;
                case 3:printf("%d\n",31+28+c);continue;
                case 4:printf("%d\n",31+28+31+c);continue;
                case 5:printf("%d\n",31+28+31+30+c);continue;
                case 6:printf("%d\n",31+28+31+30+31+c);continue;
                case 7:printf("%d\n",31+28+31+30+31+30+c);continue;
                case 8:printf("%d\n",31+28+31+30+31+30+31+c);continue;
                case 9:printf("%d\n",31+28+31+30+31+30+31+31+c);continue;
                case 10:printf("%d\n",31+28+31+30+31+30+31+31+30+c);continue;
                case 11:printf("%d\n",31+28+31+30+31+30+31+31+30+31+c);continue;
                case 12:printf("%d\n",31+28+31+30+31+30+31+31+30+31+30+c);continue;
            }
        }
        if(panduan(a)==1)
        {
            if(b==2)
            {
                if(c<1||c>29)
                    {
                        printf("error date!\n");
                        continue;
                    }
            }
            switch(b)
            {
                case 1:printf("%d\n",c);continue;
                case 2:printf("%d\n",31+c);continue;
                case 3:printf("%d\n",31+29+c);continue;
                case 4:printf("%d\n",31+29+31+c);continue;
                case 5:printf("%d\n",31+29+31+30+c);continue;
                case 6:printf("%d\n",31+29+31+30+31+c);continue;
                case 7:printf("%d\n",31+29+31+30+31+30+c);continue;
                case 8:printf("%d\n",31+29+31+30+31+30+31+c);continue;
                case 9:printf("%d\n",31+29+31+30+31+30+31+31+c);continue;
                case 10:printf("%d\n",31+29+31+30+31+30+31+31+30+c);continue;
                case 11:printf("%d\n",31+29+31+30+31+30+31+31+30+31+c);continue;
                case 12:printf("%d\n",31+29+31+30+31+30+31+31+30+31+30+c);continue;
            }
        }
    }
        return 0;
}