POJ2080

#include <stdio.h>
char s[7][15]={"Sunday","Monday", "Tuesday", "Wednesday", "Thursday", "Friday" , "Saturday"};
int a[2]={365,366};      //这两个 a,b数组感觉用的很简单和简便 
int b[2][12]={{31,28,31,30,31,30,31,31,30,31,30,31},{31,29,31,30,31,30,31,31,30,31,30,31}};
int myacing(int n);
int main()
{
    int sum;
    while(scanf("%d",&sum),sum!=-1)
    {
        int i, j, x;
        x=(sum-1)%7;     //减  1   是因为2000 1.1 是星期六 
        for(i=2000;sum>=a[myacing(i)];i++)
        sum-=a[myacing(i)];
        for(j=0;sum>=b[myacing(i)][j];j++)
        sum-=b[myacing(i)][j];
        printf("%d-%02d-%02d %s\n",i,j+1,sum+1,s[x]);     //   J+1是因为J是 从  0 开始 的，天数加  1 是因为这2000 1.1这天 
    }
    return 0;
}
int myacing(int n)
{
    if((n%4==0&&n%100!=0)||n%400==0)
    return 1;
    else
    return 0;
}