摘要：
UVA12716 GCD XOR Description Given an integer N, find how many pairs (A, B) are there such that: gcd(A, B) = A xor B where 1 ≤ B ≤ A ≤ N. Here gcd(A, 阅读全文
posted @ 2018-09-04 20:21
caomp
阅读(103)
评论(0)
推荐(0)
摘要：
UVA10791 Minimum Sum LCM Description LCM (Least Common Multiple) of a set of integers is defined as the minimum number, which is a multiple of all int 阅读全文
posted @ 2018-09-04 17:36
caomp
阅读(219)
评论(0)
推荐(0)
摘要：
UVA 10375 Choose and divide Description The binomial coefficient C(m, n) is defined as C(m, n) = m!/((m − n)! n!) Given four natural numbers p, q, r, 阅读全文
posted @ 2018-09-04 16:58
caomp
阅读(136)
评论(0)
推荐(0)
摘要：
UVA 12169 Disgruntled Judge Description Once upon a time, there was an NWERC judge with a tendency to create slightly too hard problems. As a result, 阅读全文
posted @ 2018-09-04 16:25
caomp
阅读(197)
评论(0)
推荐(0)
摘要：
UVA11582 Colossal Fibonacci Numbers! Description The i’th Fibonacci number f(i) is recursively defined in the following way: • f(0) = 0 and f(1) = 1 • 阅读全文
posted @ 2018-09-04 15:27
caomp
阅读(169)
评论(0)
推荐(0)
摘要：
博弈论入门 有一种很有意思的游戏，就是有物体若干堆，可以是火柴棍或是围棋子等等均可。两个人轮流从堆中取物体若干，规定最后取光物体者取胜。这是我国民间很古老的一个游戏，别看这游戏极其简单，却蕴含着深刻的数学原理。下面我们来分析一下要如何才能够取胜。 (一)巴什博奕（Bash Game） 定义： 只有一 阅读全文
posted @ 2018-09-04 09:45
caomp
阅读(1192)
评论(0)
推荐(2)
浙公网安备 33010602011771号