2 条题解

  • 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;
    }
    //老登布置的作业系列 
    //嗨嗨嗨 
    

    信息

    ID
    3409
    时间
    1000ms
    内存
    256MiB
    难度
    6
    标签
    递交数
    117
    已通过
    35
    上传者