2 条题解
-
3
202602zj07盛辰 (shengchen) LV 7 @ 2026-02-12 20:00:57
#include<bits/stdc++.h>
using namespace std;
int n,mon[13]={0,31,28,31,30,31,30,31,31,30,31,30,31},day=2;
int main()
{
cin>>n;
for (int i=1;i<=n-1;i++) day+=mon[i];
day%=7;
cout<<"MON TUE WED THU FRI SAT SUN"<<endl;
for (int i=1;i<=day;i++) cout<<" ";
for (int i=1;i<=mon[n];i++)
{
if (day+1>7) cout<<endl,day=0;
cout<<setw(3)<<i<<" ";
day++;
}
return 0;
} -
2@ 2026-02-12 22:59:57
#include<bits/stdc++.h> using namespace std; int n,a[13]={0,1,2,3,4,5,6,7,8,9,10,11,12}; int main(){ cin>>n; cout<<"MON TUE WED THU FRI SAT SUN"<<endl; if(n==a[1]){ cout<<" 1 2 3 4 5"<<endl; cout<<" 6 7 8 9 10 11 12"<<endl; cout<<" 13 14 15 16 17 18 19"<<endl; cout<<" 20 21 22 23 24 25 26"<<endl; cout<<" 27 28 29 30 31"<<endl; } if(n==a[2]){ cout<<" 1 2"<<endl; cout<<" 3 4 5 6 7 8 9"<<endl; cout<<" 10 11 12 13 14 15 16"<<endl; cout<<" 17 18 19 20 21 22 23"<<endl; cout<<" 24 25 26 27 28"<<endl; } if(n==a[3]){ cout<<" 1 2"<<endl; cout<<" 3 4 5 6 7 8 9"<<endl; cout<<" 10 11 12 13 14 15 16"<<endl; cout<<" 17 18 19 20 21 22 23"<<endl; cout<<" 24 25 26 27 28 29 30"<<endl<<" 31"; } if(n==a[4]){ cout<<" 1 2 3 4 5 6"<<endl; cout<<" 7 8 9 10 11 12 13"<<endl; cout<<" 14 15 16 17 18 19 20"<<endl; cout<<" 21 22 23 24 25 26 27"<<endl; cout<<" 28 29 30"<<endl; } if(n==a[5]){ cout<<" 1 2 3 4"<<endl; cout<<" 5 6 7 8 9 10 11"<<endl; cout<<" 12 13 14 15 16 17 18"<<endl; cout<<" 19 20 21 22 23 24 25"<<endl; cout<<" 26 27 28 29 30 31"<<endl; } if(n==a[6]){ cout<<" 1"<<endl; cout<<" 2 3 4 5 6 7 8"<<endl; cout<<" 9 10 11 12 13 14 15"<<endl; cout<<" 16 17 18 19 20 21 22"<<endl; cout<<" 23 24 25 26 27 28 29"<<endl; cout<<" 30"<<endl; } if(n==a[7]){ cout<<" 1 2 3 4 5 6"<<endl; cout<<" 7 8 9 10 11 12 13"<<endl; cout<<" 14 15 16 17 18 19 20"<<endl; cout<<" 21 22 23 24 25 26 27"<<endl; cout<<" 28 29 30 31"<<endl; } if(n==a[8]){ cout<<" 1 2 3"<<endl; cout<<" 4 5 6 7 8 9 10"<<endl; cout<<" 11 12 13 14 15 16 17"<<endl; cout<<" 18 19 20 21 22 23 24"<<endl; cout<<" 25 26 27 28 29 30 31"<<endl; } if(n==a[9]){ cout<<" 1 2 3 4 5 6 7"<<endl; cout<<" 8 9 10 11 12 13 14"<<endl; cout<<" 15 16 17 18 19 20 21"<<endl; cout<<" 22 23 24 25 26 27 28"<<endl; cout<<" 29 30"<<endl; } if(n==a[10]){ cout<<" 1 2 3 4 5"<<endl; cout<<" 6 7 8 9 10 11 12"<<endl; cout<<" 13 14 15 16 17 18 19"<<endl; cout<<" 20 21 22 23 24 25 26"<<endl; cout<<" 27 28 29 30 31"<<endl; } if(n==a[11]){ cout<<" 1 2"<<endl; cout<<" 3 4 5 6 7 8 9"<<endl; cout<<" 10 11 12 13 14 15 16"<<endl; cout<<" 17 18 19 20 21 22 23"<<endl; cout<<" 24 25 26 27 28 29 30"<<endl; } if(n==a[12]){ cout<<" 1 2 3 4 5 6 7"<<endl; cout<<" 8 9 10 11 12 13 14"<<endl; cout<<" 15 16 17 18 19 20 21"<<endl; cout<<" 22 23 24 25 26 27 28"<<endl; cout<<" 29 30 31"<<endl; } } 这个有点强硬
- 1
信息
- ID
- 2974
- 难度
- 6
- 分类
- (无)
- 标签
- 递交数
- 136
- 已通过
- 33
- 通过率
- 24%
- 上传者