规律
sxh759151483
这个作者很懒,什么都没留下…
展开
-
KazaQ's Socks
KazaQ's SocksProblem DescriptionKazaQ wears socks everyday.At the beginning, he has n pairs of socks numbered from 1 to n in his closets. Every morning, he puts on a pair of socks原创 2017-10-03 20:06:46 · 186 阅读 · 0 评论 -
Count
CountProf. Tigris is the head of an archaeological team who is currently in charge of an excavation in a site of ancient relics.This site contains relics of a village where civilization once flourished. One night, examining a writing record, you find som原创 2017-10-05 14:10:53 · 239 阅读 · 0 评论 -
HDU 4710 Balls Rearrangement
Bob has N balls and A boxes. He numbers the balls from 0 to N-1, and numbers the boxes from 0 to A-1. To find the balls easily, he puts the ball numbered x into the box numbered a if x = a mod A. So原创 2018-02-02 16:25:18 · 186 阅读 · 0 评论 -
硬币游戏IV
硬币游戏IV题目描述小H参加了一场神秘的游戏。游戏中有n堆硬币,第i堆价值ai。每次小H可以选择编号相差k的硬币同时拿走。注意拿走后硬币不进行重标号。小H想知道最多能拿走多大价值的硬币。输入第一行两个整数n,k。第二行n个整数。第i个整数表示ai。输出一行一个整数,表示拿走硬币的最大价值。样例输入7 37 5 8 6 4 3 2样例输出33提示对于20%的数据,n<=20。 对于40...原创 2018-03-13 15:10:32 · 352 阅读 · 0 评论 -
6617:Finite Encyclopedia of Integer Sequences
In Finite Encyclopedia of Integer Sequences (FEIS), all integer sequences of lengths between 1 and N (inclusive) consisting of integers between 1 and K (inclusive) are listed.Let the total number of ...原创 2018-08-04 09:25:23 · 183 阅读 · 0 评论 -
upc9520: Knight (象棋马从(0,0)到(n,m)的最小步数)
题目描述有一张无限大的棋盘,你要将马从(0,0)移到(n,m)。每一步中,如果马在(x,y),你可以将它移动到(x+1,y+2),(x+1,y−2),(x−1,y+2),(x−1,y−2),(x+2,y+1),(x+2,y−1),(x−2,y+1)或(x−2,y−1)。你需要最小化移动步数。 输入第一行一个整数t表示数据组数 (1≤t≤1000)。每组数据一行两个整数n,m ...原创 2018-10-28 17:13:15 · 2235 阅读 · 0 评论