2016年12月_LzyRapX

原创 PE 112 Bouncy numbers （模拟）

Bouncy numbersProblem 112Working from left-to-right if no digit is exceeded by the digit to its left it is called an increasing number; for example, 134468.Similarly if no digit is excee

2016-12-27 23:18:51 514

原创 PE 301 Nim （Nim博弈）

NimProblem 301Nim is a game played with heaps of stones, where two players take it in turn to remove any number of stones from any heap until no stones remain.We'll consider the three-he

2016-12-27 20:18:35 378

原创 PE 145 How many reversible numbers are there below one-billion? （暴力）

How many reversible numbers are there below one-billion?Problem 145Some positive integers n have the property that the sum [ n + reverse(n) ] consists entirely of odd (decimal) digits. For

2016-12-27 19:51:39 526

原创 PE 233 Lattice points on a circle (数论：毕格拉斯三元组（勾股数）)

Lattice points on a circle Problem 233 Let f(N) be the number of points with integer coordinates that are on a circle passing through (0,0), (N,0),(0,N), and (N,N). It can be shown that f(10000) = 3

2016-12-26 23:52:31 1188

原创 PE 110 Diophantine reciprocals II （数论：分式个数）（加强版）（dfs）

PE 110题目 PE 108 题解从PE 108 我们可以知道，分式 1a+1b=1n\dfrac{1}{a}+\dfrac{1}{b}=\dfrac{1}{n} 的个数就是1+d(n2)2\dfrac{1+d(n^2)}{2}，其中d(n)d(n)是n的约数的个数。、而 PE 110 只是PE 108的加强版。用PE 108的方法换个方式就可以了。比如：n=2p13p25p3.....

2016-12-26 23:13:14 640

原创 PE 108 Diophantine reciprocals I (数论：分式个数)

PE108 分式1a+1b=1n\dfrac{1}{a}+\dfrac{1}{b}=\dfrac{1}{n}的不同个数其实就是1+d(n2)2\dfrac{1+d(n^2)}{2}，其中d(n)d(n)是nn的约数个数。证明：1b=1n−1a=a−nan\dfrac{1}{b}=\dfrac{1}{n}-\dfrac{1}{a}=\dfrac{a-n}{an}==>==>b=ana−nb=\dfr

2016-12-24 17:15:20 555

原创 PE 107 Minimal network （MST）

Minimal networkProblem 107The following undirected network consists of seven vertices and twelve edges with a total weight of 243.The same network can be represented by the matrix be

2016-12-24 00:14:28 669

原创 PE 106 Special subset sums: meta-testing （位运算枚举子集）

Special subset sums: meta-testingProblem 106Let S(A) represent the sum of elements in set A of size n. We shall call it a special sum set if for any two non-empty disjoint subsets, B and C

2016-12-21 21:05:18 576

原创 PE 105 Special subset sums: testing （位运算枚举子集）

Special subset sums: testingProblem 105Let S(A) represent the sum of elements in set A of size n. We shall call it a special sum set if for any two non-empty disjoint subsets, B and C, the

2016-12-20 12:17:42 587

原创 PE 104 Pandigital Fibonacci ends （数学fibonacci）

Pandigital Fibonacci endsProblem 104The Fibonacci sequence is defined by the recurrence relation:Fn = Fn−1 + Fn−2, where F1 = 1 and F2 = 1.It turns out that F541, which contains 113 di

2016-12-18 20:22:21 533

原创 PE 101 Optimum polynomial（拉格朗日插值）

Optimum polynomialProblem 101If we are presented with the first k terms of a sequence it is impossible to say with certainty the value of the next term, as there are infinitely many polyno

2016-12-11 19:45:37 1056

原创 PE 121 Disc game prize fund （第一类斯特林）

Disc game prize fundProblem 121A bag contains one red disc and one blue disc. In a game of chance a player takes a disc at random and its colour is noted. After each turn the disc is returned to the ba

2016-12-10 12:57:34 652

原创 CSU 1804: 有向无环图 (拓扑排序)

题目链接：点击打开链接1804: 有向无环图Time Limit: 5 Sec Memory Limit: 128 MBSubmit: 421 Solved: 186[Submit][Status][Web Board]DescriptionBobo 有一个 n 个点，m 条边的有向无环图（即对于任意点 v，不存在从点 v 开始、点 v 结束的路

2016-12-09 00:02:10 1534

原创 16哈理工新生赛 J Another Tree （树上BFS）

题目链接：点击打开链接Another TreeTime Limit: 1000 MSMemory Limit: 32768 KTotal Submit: 42(16 users)Total Accepted: 15(14 users)Rating: Special Judge: No

2016-12-08 15:50:44 555

原创 16浙理工新生赛 K KI的目标 (树上dfs)

4248: KI的目标Time Limit: 2 Sec Memory Limit: 128 MBSubmit: 290 Solved: 73DescriptionKI给自己制定了最近制定了一些学习目标，因为有些大目标的达到要先完成一些小目标，所以KI就下意识的把这些目标连成了一棵树，以1号目标为根。 KI是个很谨慎的人，于是他请他的朋友们对这棵树上的每条边

2016-12-07 20:32:54 425

原创 16哈理工新生赛 D 陈月亮的数学题（数论）

题目链接：点击打开题目链接陈月亮的数学题 Time Limit: 2000 MS Memory Limit: 32768 K Total Submit: 102(27 users) Total Accepted: 46(23 users) Rating: Special Judge: No Description 陈月亮从小就热爱数学，这天老师讲到任何一个正整数N，我们可以很容易的找出

2016-12-07 18:22:07 1086

原创 16哈理工新生赛 H 下雪啦（哈希表）

题目链接：点击打开链接下雪啦Time Limit: 2500 MSMemory Limit: 32768 KTotal Submit: 184(32 users)Total Accepted: 33(10 users)Rating: Special Judge: NoDesc

2016-12-06 22:59:13 846

原创 16哈理工新生赛 K 小明和字符串（水题）

题目链接：点击打开链接小明和字符串Time Limit: 1000 MSMemory Limit: 32768 KTotal Submit: 90(53 users)Total Accepted: 58(53 users)Rating: Special Judge: NoDe

2016-12-06 19:41:48 965

原创 16哈理工新生赛 I 行编辑器（模拟）

题目链接：点击打开链接行编辑器Time Limit: 1000 MSMemory Limit: 32768 KTotal Submit: 109(60 users)Total Accepted: 64(57 users)Rating: Special Judge: NoDes

2016-12-06 19:32:14 727

原创 16哈理工新生赛 G FBI Tree （模拟二叉树后序遍历）

题目链接：点击打开链接FBI TreeTime Limit: 1000 MSMemory Limit: 32768 KTotal Submit: 58(41 users)Total Accepted: 47(41 users)Rating: Special Judge: NoDescri

2016-12-06 14:11:43 533

原创 16哈理工新生赛 E Nine Digits （BFS+康拓展开）

Nine DigitsTime Limit: 3000 MSMemory Limit: 32768 KTotal Submit: 69(19 users)Total Accepted: 16(12 users)Rating: Special Judge: NoDescription

2016-12-05 23:32:04 732

原创 16哈理工新生赛 C 方方正正（证明题）

方方正正Time Limit: 1000 MSMemory Limit: 32768 KTotal Submit: 87(24 users)Total Accepted: 19(15 users)Rating: Special Judge: NoDescription一个r行c列

2016-12-05 21:14:31 553

原创 16哈理工新生赛 B 修建传送门（双指针）

修建传送门Time Limit: 1000 MSMemory Limit: 32768 KTotal Submit: 104(29 users)Total Accepted: 30(24 users)Rating: Special Judge: NoDescription

2016-12-05 19:14:40 407

原创 16哈理工新生赛 A 棋盘村 (dp)

题目链接：点击打开链接棋盘村Time Limit: 1000 MSMemory Limit: 32768 KTotal Submit: 219(72 users)Total Accepted: 71(61 users)Rating: Special Judge: NoDesc

2016-12-04 14:06:54 363

原创浙江理工大学新生赛 B 巴比伦花园（RMQ）(二分)

题目链接：点击打开链接首先，这题居然是zstu新生题....强!这题一眼看下去，线段树肯定能写。不过这题还有另外的解法。就是RMQ+二分。要先来预处理一下，预处理每个点最能够到达的最远距离，然后RMQ存一下区间内点能到达的最远距离，然后在查询的时候，二分查询(L,R)区间能够到达的超过或等于R的第一个点的位置，然后L到这个位置-1这段区间，RMQ查询其最远距离，然后这两者取max就是答

2016-12-04 01:11:06 601

原创 CSU 1803 2016（16湖南省赛）(同余定理)

1803: 2016Time Limit: 5 Sec Memory Limit: 128 MBSubmit: 638 Solved: 419[Submit][Status][Web Board]Description 给出正整数 n 和 m，统计满足以下条件的正整数对 (a,b) 的数量：1. 1≤a

2016-12-03 01:48:24 565

LzyRapX