练习1

输出日历：

#include<iostream>

using namespace std;

int mm[] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};

// 闰年判断
bool isLeap(int y)
{
    return ((y%4 == 0 && y%100 != 0) || (y%400 == 0));
} 

// 基姆拉尔森计算公式
int week(int y, int m, int d)
{
    if(m == 1 || m == 2){
        m += 12;y--;
    }
    int r = (d + 2*m + 3*(m+1)/5 + y + y/4 - y/100 + y/400 + 1)%7;
    return (r == 0)?7:r;
}

void cal(int year)
{
    if(isLeap(year)) mm[2] = 29;
    for(int i=1;i<=12;i++){
        cout<<"---Mouth:"<<i<<"---
";
        int s = week(year, i, 1)%7;
        for(int t=0;t<=s-1;t++) cout<<"	";
        for(int j=1;j<=mm[i];j++){
            cout<<j<<'	';
            if(!((++s)%7)) cout<<'
';
         }
         cout<<"
-----------------------------------------------------
";
    }
}

int main()
{
    int y, m, d;
    // while(cin>>y>>m>>d)
    while(cin>>y)
    {
        // 检测
        /*
        int s = 1;
        for(int i=1;i<=12;i++){
            for(int j=1;j<=mm[i];j++){
                cout<<week(y, i, j)<<'	';
                if(s%7 == 0) cout<<'
';
                s++;
            }
        }
        */
        // cout<<week(y, m, d)<<'
';
        cal(y);
        
    }
    
    return 0;
 } 

 2019-03-19

23:27:48