【题目链接】
ybt 1083:计算星期几
OpenJudge NOI 小学奥数 7831:计算星期几
【题目考点】
1. 同余定理
根据同余定理,有:
(
a
∗
b
)
%
m
=
(
a
%
m
∗
b
%
m
)
%
m
(a*b)\%m = (a\%m * b\%m)\%m
(a∗b)%m=(a%m∗b%m)%m
2. 幂取模
a
b
%
m
=
(
a
b
−
1
⋅
a
)
%
m
=
(
a
b
−
1
%
m
⋅
a
%
m
)
%
m
\begin{aligned} a^b\%m &= (a^{b-1} \cdot a) \% m \\ &= (a^{b-1}\%m \cdot a \%m)\%m \end{aligned}
ab%m=(ab−1⋅a)%m=(ab−1%m⋅a%m)%m
这就是求
a
b
%
m
a^b \%m
ab%m的递推公式
其中b = 1时
a
b
%
m
=
a
%
m
a^b\%m = a \%m
ab%m=a%m
3.选择输出字符串时,可以用switch语句。也可以将各星期的字符串存入二维字符数组(或string类数组)中,用下标索引。
【解题思路】
1. 递推
设v[i]表示
a
b
%
m
a^b \% m
ab%m
有:
v[i] = (v[i-1] * a%m) %m;
v[1] = a % m;
2. 迭代
迭代法思路与递推相似,只不过不用数组,只用变量。每次求出的值都赋值给变量s。
初始值:s = a % m;
循环中:s = (s * (a % m)) % m;
3. 递归
函数设为:
int solve(int b);
求
a
b
%
m
a^b \% m
ab%m的值
要求该值,需要先求
a
b
−
1
%
m
a^{b-1}\% m
ab−1%m的值,而后代入公式
a
b
%
m
=
(
a
b
−
1
%
m
⋅
a
%
m
)
%
m
a^b\%m = (a^{b-1}\%m \cdot a \%m)\%m
ab%m=(ab−1%m⋅a%m)%m
【题解代码】
解法1:迭代法,用switch语句
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a, b, s = 1;
cin>>a>>b;
a %= 7; //使a的值为a % m,本题中m为7
for(int i = 0; i < b; ++i)
s = (s * a) % 7;
switch(s)//从周日过了s天
{
case 0:
cout<<"Sunday";
break;
case 1:
cout<<"Monday";
break;
case 2:
cout<<"Tuesday";
break;
case 3:
cout<<"Wednesday";
break;
case 4:
cout<<"Thursday";
break;
case 5:
cout<<"Friday";
break;
case 6:
cout<<"Saturday";
break;
}
return 0;
}
解法2:递推,用二维字符数组
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a, b, v[10005];//v[i]表示a^b%7的值,为0~6,表示周日到周六
char s[7][20] = {"Sunday","Monday","Tuesday","Wednesday","Thursday","Friday","Saturday"};//s[0]~s[6]分别对应周日到周六的字符串
cin>>a>>b;
a %= 7;//a为a % m
v[1] = a;
for(int i = 2; i <= b; ++i)
v[i] = (v[i-1] * a) % 7;
cout<<s[v[b]];
return 0;
}
解法3:递归,用string类数组
#include<bits/stdc++.h>
using namespace std;
int solve(int a, int b)//求a^b%7的值,结果为0~6,表示周日到周六
{
if(b == 1)
return a;
else
return (solve(a, b - 1) * a) % 7;
}
int main()
{
int a, b;
string s[7] = {"Sunday","Monday","Tuesday","Wednesday","Thursday","Friday","Saturday"};//s[0]~s[6]分别对应周日到周六的字符串
cin>>a>>b;
cout<<s[solve(a % 7, b)];//solve(a % 7, b)返回0~6,表示周日到周六
return 0;
}