数论
文章平均质量分 74
「已注销」
xx
展开
-
LightOJ 1248 Dice (III) [期望]
LightOJ 1248 Dice (III) [期望];Given a dice with n sides, you have to find the expected number of times you have to throw that dice to see all its faces at least once. Assume that the dice is fair, that means when you throw the dice, the probability of occ原创 2017-07-20 09:26:08 · 368 阅读 · 0 评论 -
hdu 6004 Periodical Cicadas [2016 CCPC-Final F] [同余]
hdu 6004 Periodical Cicadas[2016 CCPC-Final F] [同余];原创 2017-07-26 10:56:34 · 1066 阅读 · 6 评论 -
hdu 6061 RXD and functions [快速数论变换]
RXD has a polynomial function f(x)f(x), f(x)=∑ni=0cixif(x)=∑i=0ncixi RXD has a transformation of function Tr(f,a)Tr(f,a), it returns another function gg, which has a property that g(x)=f(x−a)g(x)=f(x−a). Given a1,a2,a3,…,ama1,a2,a3,…,am, RXD generates a原创 2017-08-02 20:02:19 · 324 阅读 · 0 评论 -
NTT(快速数论变换)用到的各种素数及原根
g是mod(r * 2 ^ k + 1)的原根r * 2 ^ k + 1rkg31125122171439735原创 2017-08-02 11:06:38 · 9028 阅读 · 0 评论 -
xtu 1260 Determinant [2017年“嘉杰信息杯” 中国大学生程序设计竞赛全国邀请赛(湖南) A题]
xtu 1260 Determinant [2017年“嘉杰信息杯” 中国大学生程序设计竞赛全国邀请赛(湖南) A题];Bobo learned the definition of determinant det(A) of matrix A in ICPCCamp. He also knew determinant can be computed in O(n3) using Gaussian Elimination.Bobo has an (n−1)×n matrix B he would li原创 2017-07-19 21:06:56 · 463 阅读 · 0 评论 -
UVALive - 7715 Guessing Game
点击打开题目题意:给出A1,A2,B1,B2,C1,C2,N,问有多少种方法使得A1 分析:要使A+B+C = N,即求A+B = N-C有多少种解法,那么N-C有一个取值范围[l, r],且这个区间的一个值唯一对应一个C值,那么现在就是求A+B = K(K = N-C)有多少种取值了先看这样一个例子, A1 = 0, A2 = 2,B1 = 1, B2 = 6的情况,原创 2017-07-31 20:11:33 · 303 阅读 · 0 评论 -
hdu 6053 TrickGCD [2017 Multi-University Training Contest - Team 2] [莫比乌斯函数]
[容斥][莫比乌斯]题意: 给你一个序列a,求满足对于所有l, r都有gcd(b[l], ... , b[r]) >= 2并且bi 分析: 先枚举gcd的值, 然后利用前缀和快速算出a[i]/g = c(c = 1, 2, 3, ...)的个数, 然后用快速幂, 快速算出gcd为g的时候的值, 最后用容斥筛选一下.原创 2017-07-27 21:21:08 · 224 阅读 · 0 评论 -
LightOJ 1038 Race to 1 Again [概率dp]
lightoj 1038 Race to 1 Again [概率dp];Rimi learned a new thing about integers, which is - any positive integer greater than 1 can be divided by its divisors. So, he is now playing with this property. He selects a number N. And he calls this D.In each turn原创 2017-07-20 08:49:21 · 240 阅读 · 0 评论 -
LightOJ - 1104 Birthday Paradox [概率]
LightOJ - 1104 Birthday Paradox [概率];Birthday Paradox Sometimes some mathematical results are hard to believe. One of the common problems is the birthday paradox. Suppose you are in a party where there are 23 people including you. What is the probabili原创 2017-07-20 10:25:01 · 297 阅读 · 0 评论 -
uva 1635 Irrelevant Elements [组合数, 唯一分解定理]
uva1635 Irrelevant Elements; 唯一分解定理; 组合数;Young cryptoanalyst Georgie is investigating different schemes of generating random integer numbersranging from 0 to m − 1. He thinks that standard random number generators are not good enough, sohe has invented原创 2017-07-19 21:11:07 · 243 阅读 · 0 评论 -
hdu 6051 If the starlight never fade [欧拉函数] [2017 Multi-University Training Contest - Team 2]
If the starlight never fadeTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 104 Accepted Submission(s): 50Problem DescriptionW原创 2017-07-28 11:50:28 · 684 阅读 · 0 评论