2 条题解

  • 2
    @ 2026-2-2 15:42:59 
    #include <bits/stdc++.h>
using namespace std;const int N=1e5+10;const int INF=0x3f3f3f3f;int main() {int m;cin >> m;int ds[] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};int w = 3;for(int i = 1; i < m; ++i)w = (w + ds[i-1]) % 7;cout << "MON TUE WED THU FRI SAT SUN" << endl;for(int i = 0; i < (w + 6) % 7; ++i)cout << "    ";for(int day = 1; day <= ds[m-1]; ++day){cout << setw(3) << day;if ((day + (w + 6) % 7) % 7 == 0 || day == ds[m-1])cout << endl;else cout << " ";}return 0;}

    满级对比

    #include<bits/stdc++.h>
using namespace std;
const int N=1e3+10;
int main()
{
    int n;
	cin>>n;
	cout<<"MON TUE WED THU FRI SAT SUN"<<endl; 
	switch(n){
		case 1:
			cout<<"          1   2   3   4   5\n";
			cout<<"  6   7   8   9  10  11  12\n";
			cout<<" 13  14  15  16  17  18  19\n";
			cout<<" 20  21  22  23  24  25  26\n";
			cout<<" 27  28  29  30  31";
			break;
		case 2:
			cout<<"                      1   2\n";
			cout<<"  3   4   5   6   7   8   9\n";
			cout<<" 10  11  12  13  14  15  16\n";
			cout<<" 17  18  19  20  21  22  23\n";
			cout<<" 24  25  26  27  28";
			break;
		case 3:
			cout<<"                      1   2\n";
			cout<<"  3   4   5   6   7   8   9\n";
			cout<<" 10  11  12  13  14  15  16\n";
			cout<<" 17  18  19  20  21  22  23\n";
			cout<<" 24  25  26  27  28  29  30\n";
			cout<<" 31";
			break;
		case 4:
			cout<<"      1   2   3   4   5   6\n";
			cout<<"  7   8   9  10  11  12  13\n";
			cout<<" 14  15  16  17  18  19  20\n";
			cout<<" 21  22  23  24  25  26  27\n";
			cout<<" 28  29  30";
			break;
		case 5:
			cout<<"              1   2   3   4\n";
			cout<<"  5   6   7   8   9  10  11\n";
			cout<<" 12  13  14  15  16  17  18\n";
			cout<<" 19  20  21  22  23  24  25\n";
			cout<<" 26  27  28  29  30  31";
			break;
		case 6:
			cout<<"                          1\n";
			cout<<"  2   3   4   5   6   7   8\n";
			cout<<"  9  10  11  12  13  14  15\n";
			cout<<" 16  17  18  19  20  21  22\n";
			cout<<" 23  24  25  26  27  28  29\n";
			cout<<" 30";
			break;
		case 7:
			cout<<"      1   2   3   4   5   6\n";
			cout<<"  7   8   9  10  11  12  13\n";
			cout<<" 14  15  16  17  18  19  20\n";
			cout<<" 21  22  23  24  25  26  27\n";
			cout<<" 28  29  30  31";
			break;
		case 8:
			cout<<"                  1   2   3\n";
			cout<<"  4   5   6   7   8   9  10\n";
			cout<<" 11  12  13  14  15  16  17\n";
			cout<<" 18  19  20  21  22  23  24\n";
			cout<<" 25  26  27  28  29  30  31";
			break;
		case 9:
			cout<<"  1   2   3   4   5   6   7\n";
			cout<<"  8   9  10  11  12  13  14\n";
			cout<<" 15  16  17  18  19  20  21\n";
			cout<<" 22  23  24  25  26  27  28\n";
			cout<<" 29  30";
			break;
	    case 10:
			cout<<"          1   2   3   4   5\n";
			cout<<"  6   7   8   9  10  11  12\n";
			cout<<" 13  14  15  16  17  18  19\n";
			cout<<" 20  21  22  23  24  25  26\n";
			cout<<" 27  28  29  30  31";
			break;
		case 11:
			cout<<"                      1   2\n";
			cout<<"  3   4   5   6   7   8   9\n";
			cout<<" 10  11  12  13  14  15  16\n";
			cout<<" 17  18  19  20  21  22  23\n";
			cout<<" 24  25  26  27  28  29  30";
			break;
		case 12:
			cout<<"  1   2   3   4   5   6   7\n";
			cout<<"  8   9  10  11  12  13  14\n";
			cout<<" 15  16  17  18  19  20  21\n";
			cout<<" 22  23  24  25  26  27  28\n";
			cout<<" 29  30  31";
			break;
	}
	return 0;
}
//老登布置的作业系列 
//嗨嗨嗨
    • 1
      @ 2026-2-2 15:44:55

      超绝switch大法

      #include<bits/stdc++.h>
using namespace std;
const int N=1e3+10;
int main()
{
    int n;
	cin>>n;
	cout<<"MON TUE WED THU FRI SAT SUN"<<endl; 
	switch(n){
		case 1:
			cout<<"          1   2   3   4   5\n";
			cout<<"  6   7   8   9  10  11  12\n";
			cout<<" 13  14  15  16  17  18  19\n";
			cout<<" 20  21  22  23  24  25  26\n";
			cout<<" 27  28  29  30  31";
			break;
		case 2:
			cout<<"                      1   2\n";
			cout<<"  3   4   5   6   7   8   9\n";
			cout<<" 10  11  12  13  14  15  16\n";
			cout<<" 17  18  19  20  21  22  23\n";
			cout<<" 24  25  26  27  28";
			break;
		case 3:
			cout<<"                      1   2\n";
			cout<<"  3   4   5   6   7   8   9\n";
			cout<<" 10  11  12  13  14  15  16\n";
			cout<<" 17  18  19  20  21  22  23\n";
			cout<<" 24  25  26  27  28  29  30\n";
			cout<<" 31";
			break;
		case 4:
			cout<<"      1   2   3   4   5   6\n";
			cout<<"  7   8   9  10  11  12  13\n";
			cout<<" 14  15  16  17  18  19  20\n";
			cout<<" 21  22  23  24  25  26  27\n";
			cout<<" 28  29  30";
			break;
		case 5:
			cout<<"              1   2   3   4\n";
			cout<<"  5   6   7   8   9  10  11\n";
			cout<<" 12  13  14  15  16  17  18\n";
			cout<<" 19  20  21  22  23  24  25\n";
			cout<<" 26  27  28  29  30  31";
			break;
		case 6:
			cout<<"                          1\n";
			cout<<"  2   3   4   5   6   7   8\n";
			cout<<"  9  10  11  12  13  14  15\n";
			cout<<" 16  17  18  19  20  21  22\n";
			cout<<" 23  24  25  26  27  28  29\n";
			cout<<" 30";
			break;
		case 7:
			cout<<"      1   2   3   4   5   6\n";
			cout<<"  7   8   9  10  11  12  13\n";
			cout<<" 14  15  16  17  18  19  20\n";
			cout<<" 21  22  23  24  25  26  27\n";
			cout<<" 28  29  30  31";
			break;
		case 8:
			cout<<"                  1   2   3\n";
			cout<<"  4   5   6   7   8   9  10\n";
			cout<<" 11  12  13  14  15  16  17\n";
			cout<<" 18  19  20  21  22  23  24\n";
			cout<<" 25  26  27  28  29  30  31";
			break;
		case 9:
			cout<<"  1   2   3   4   5   6   7\n";
			cout<<"  8   9  10  11  12  13  14\n";
			cout<<" 15  16  17  18  19  20  21\n";
			cout<<" 22  23  24  25  26  27  28\n";
			cout<<" 29  30";
			break;
	    case 10:
			cout<<"          1   2   3   4   5\n";
			cout<<"  6   7   8   9  10  11  12\n";
			cout<<" 13  14  15  16  17  18  19\n";
			cout<<" 20  21  22  23  24  25  26\n";
			cout<<" 27  28  29  30  31";
			break;
		case 11:
			cout<<"                      1   2\n";
			cout<<"  3   4   5   6   7   8   9\n";
			cout<<" 10  11  12  13  14  15  16\n";
			cout<<" 17  18  19  20  21  22  23\n";
			cout<<" 24  25  26  27  28  29  30";
			break;
		case 12:
			cout<<"  1   2   3   4   5   6   7\n";
			cout<<"  8   9  10  11  12  13  14\n";
			cout<<" 15  16  17  18  19  20  21\n";
			cout<<" 22  23  24  25  26  27  28\n";
			cout<<" 29  30  31";
			break;
	}
	return 0;
}
//老登布置的作业系列 
//嗨嗨嗨
      • 1

      日历制作

      信息

      ID
      3409
      时间
      1000ms
      内存
      256MiB
      难度
      6
      标签
      递交数
      116
      已通过
      34
      上传者
      1. Language
      2. 兼容模式
      3. 主题
      3. Worker 0, 18ms
      4. Powered by Hydro v5.0.0-beta.8 Community