2017年09月_cc_wood

09月 08月 07月 04月

原创 Another Easy Problem FZU - 1753唯一分解定理

题目链接小TT最近学习了高斯消元法解方程组,现在他的问题来了，如果是以下的方程，那么应该如何解呢?C(n1,m1)==0 (mod M)C(n2,m2)==0 (mod M)C(n3,m3)==0 (mod M)................C(nk,mk)==0 (mod M)小TT希望你告诉他满足条件的最大的M其中C(i,j)表示组合数,例如C(5,2)=10,C(4,2)=6...Inpu

2017-09-29 21:23:32 427

原创 Divisors POJ - 2992

题目链接Your task in this problem is to determine the number of divisors of Cnk. Just for fun -- or do you need any special reason for such a useful computation? InputThe input consists of several instanc

2017-09-29 20:54:16 633

原创 Period of an Infinite Binary Expansion POJ - 3358 欧拉函数

题目链接Let {x} = 0.a1a2a3... be the binary representation of the fractional part of a rational number z. Suppose that {x} is periodic then, we can write{x} = 0.a1a2...ar(ar+1ar+2...ar+s)wfor some integers

2017-09-28 23:24:13 491

原创 Happy 2006 POJ - 2773 数论

题目链接Two positive integers are said to be relatively prime to each other if the Great Common Divisor (GCD) is 1. For instance, 1, 3, 5, 7, 9...are all relatively prime to 2006.Now your job is easy: for

2017-09-28 23:13:44 342

原创 Coin 2017 西安网络赛快速幂 + 二项式定理

题目链接Bob has a not even coin, every time he tosses the coin, the probability that the coin’s front face up is qp(qp≤12)qp(qp≤12)pq(pq≤21).qp(qp≤12)\frac{q}{p}(\frac{q}{p} \le \frac{1}{2})

2017-09-16 18:45:08 344

原创 number number number hdu 6189 矩阵快速幂

题目链接We define a sequence F:⋅ F0=0,F1=1;⋅ Fn=Fn−1+Fn−2 (n≥2).Give you an integer k, if a positive number n can be expressed byn=Fa1+Fa2+...+Fak where 0≤a1≤a2≤⋯≤ak, this positive number is mjf−good. Ot

2017-09-10 19:44:01 448

原创 Snakes and Ladders LightOJ - 1151 概率dp + 高斯消元

题目链接'Snakes and Ladders' or 'Shap-Ludu' is a game commonly played in Bangladesh. The game is so common that it would be tough to find a person who hasn't played it. But those who haven't played it (unl

2017-09-07 19:14:50 774

原创 More Divisors ZOJ - 2562 反素数

题目链接Everybody knows that we use decimal notation, i.e. the base of our notation is 10. Historians say that it is so because men have ten fingers. Maybe they are right. However, this is often not very c

2017-09-02 13:33:52 371

原创 Primitive Roots POJ - 1284 原根, 欧拉函数

题目链接We say that integer x, 0 < x < p, is a primitive root modulo odd prime p if and only if the set { (x^i mod p) | 1 <= i <= p-1 } is equal to { 1, ..., p-1 }. For example, the consecutive powers of 3

2017-09-02 09:20:40 388

原创 Nice Milk POJ - 1271 UVA 10117 半平面相交

题目链接: POJ1271 , UVa 10117 Little Tomy likes to cover his bread with some milk. He does this by putting it in the cup so that one of its sides (called bottom side) touches the bottom of the cup, just as the pi

2017-09-01 14:51:37 603