- 博客(5)
- 收藏
- 关注
RSS订阅原创 2016多校训练一 PowMod，hdu5728（欧拉函数+指数循环节）
Declare:k=∑mi=1φ(i∗n) mod 1000000007n is a square-free number.φ is the Euler's totient function.find:ans=kkkk...k mod pThere are infinite number of k InputMultipl
2016-07-20 13:22:02
3473
4
原创 Codeforces Round #362 (Div. 1) C PLEASE(组合数学，指数循环节)
As we all know Barney's job is "PLEASE" and he has not much to do at work. That's why he started playing "cups and key". In this game there are three identical cups arranged in a line from left to rig
2016-07-20 10:03:33
991
转载 组合数学 转动群
组合数学中比较困难的波利亚定理应用最大的障碍是不理解所要解决的立体形状的具体信息。下文详细列举了所有常见的形状和其详尽的信息。 正四面体：阶12，顶点4个，面4个，棱6条，均为等边三角形转动群顶点面棱个数不动(1)4(1)4(1)61顶点-面心 ±120度(1)(3)(1)(3)(3)28
2016-07-06 16:29:35
968
原创 POJ 2154 Color (Polya定理&欧拉函数)
Beads of N colors are connected together into a circular necklace of N beads (N<=1000000000). Your job is to calculate how many different kinds of the necklace can be produced. You should know that th
2016-07-06 13:37:40
383
原创 HDU 3658 How many words (矩阵快速幂&递推)
In order to make a new word, we will pick out m letters from all the upper case letters and lower case letters(from `a' to `Z'). Therefore, that means you can pick some same letters. But here are two
2016-07-05 20:52:24
553
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人