nobleman

Eddy’s digital RootsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 7275 Accepted Submission(s): 3999Problem DescriptionThe digital root of

月之数Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 11254 Accepted Submission(s): 6594Problem Description当寒月还在读大一的时候，他在一本武林秘籍中（据后来考证，估计是计算机基础

All XTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 2577 Accepted Submission(s): 1070Problem DescriptionF(x,m) 代表一个全是由数字x组成的m位数字。请计算，以下式子是否

HeHeTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others) Total Submission(s): 1328 Accepted Submission(s): 448Problem DescriptionIn the equation X^2≡X(mod N) where x∈

小明系列故事——师兄帮帮忙Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others) Total Submission(s): 6060 Accepted Submission(s): 1700Problem Description　　小明自从告别了ACM/ICPC之后，就开始潜心研究

E 开心的涂刷题目描述一天小明同学拿着m种颜色的油漆去涂刷n块格子，在涂刷的过程中他发现有很多种涂色方案，并很快的算出了答案，然后他发现如果涂好颜色的格子中只要存在某两个相邻的格子颜色一样，他就会感到开心，他想知道有多少种让他开心的涂刷方案。输入描述:输入仅包含一行，包含两个数n，m分别表示格子数和颜色数。（1 <= n <= 1e12, 1 <= m <= 1e12)输出描述:输出一行包含一个

题目描述 已知f[1][1]=1,f[i][j]=a*f[i-1][j]+b*f[i-1][j-1] (i&gt;=2,1&lt;=j&lt;=i)。对于其他情况f[i][j]=0有T组询问，每次给出a,b,n,m，求f[n][m] mod (998244353)输入描述:第一行为一个整数T，表示询问个数。接下来一共T行，每行四个整数a,b,n,m。输出描述:...

SumTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 4036 Accepted Submission(s): 1647Problem DescriptionSample Input2Sample Ou...