摘要：
2D-Nim Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 4136 Accepted: 1882 Description The 2D-Nim board game is played on a grid, with piec 阅读全文
摘要：
第k短路： K短路的定义：假设从1出发，有M条长度不同的路径可以到达点N，则K短路就是这M条路径中第K小的路径长度。 以上所述，设f[n]为最终所求，则f(n)=g(n)+h(n);h(n)就是我们所说的‘启发式函数’，表示为重点t到其余一点p的路径长度，g（n）表示g当前从s到p所走的路径的长度。 阅读全文
摘要：
因果卷积（causal）与扩展卷积（dilated）之An Empirical Evaluation of Generic Convolutional and Recurrent Networks for Sequence Modeling 最近在看关于NLP（自然语言处理）方面的文章，（其实不是自 阅读全文
摘要：
Packets Description A factory produces products packed in square packets of the same height h and of the sizes 1*1, 2*2, 3*3, 4*4, 5*5, 6*6. These pro 阅读全文
摘要：
Numbers That Count Description "Kronecker's Knumbers" is a little company that manufactures plastic digits for use in signs (theater marquees, gas sta 阅读全文
摘要：
Jury Compromise Description In Frobnia, a far-away country, the verdicts in court trials are determined by a jury consisting of members of the general 阅读全文
摘要：
Dividing Description Marsha and Bill own a collection of marbles. They want to split the collection among themselves so that both receive an equal sha 阅读全文
摘要：
Counterfeit Dollar Description Sally Jones has a dozen Voyageur silver dollars. However, only eleven of the coins are true silver dollars; one coin is 阅读全文
摘要：
Joseph Description The Joseph's problem is notoriously known. For those who are not familiar with the original problem: from among n people, numbered 阅读全文
摘要：
POJ 1011 POJ 1011 2018年07月23日 18:14:17 阅读数：1 编辑 2018年07月23日 18:14:17 阅读数：1 编辑 阅读数：1 编辑 Sticks Time Limit: 1000MS Memory Limit: 10000K Total Submission 阅读全文