上一页 1 ··· 4 5 6 7 8 9 10 11 12 ··· 16 下一页
摘要: Election of a Mayor Gym - 100513E The Berland capital is preparing for mayoral election. There are two candidates for the position: the current mayor 阅读全文
posted @ 2018-12-05 11:30 *starry* 阅读(263) 评论(0) 推荐(0) 编辑
摘要: Brackets POJ - 2955 We give the following inductive definition of a “regular brackets” sequence: the empty sequence is a regular brackets sequence, if 阅读全文
posted @ 2018-12-04 16:56 *starry* 阅读(325) 评论(0) 推荐(0) 编辑
摘要: Easy Game LightOJ - 1031 You are playing a two player game. Initially there are n integer numbers in an array and player A and B get chance to take th 阅读全文
posted @ 2018-12-04 15:40 *starry* 阅读(189) 评论(0) 推荐(0) 编辑
摘要: Beauty of Array ZOJ - 3872 Edward has an array A with N integers. He defines the beauty of an array as the summation of all distinct integers in the a 阅读全文
posted @ 2018-12-03 20:03 *starry* 阅读(293) 评论(0) 推荐(0) 编辑
摘要: 小乐乐下象棋 链接:https://ac.nowcoder.com/acm/contest/301/F来源:牛客网 题目描述 小乐乐一天天就知道玩,这一天又想玩象棋。 我们都知道马走日。 现在给定一个棋盘,大小是n*m,把棋盘放在第一象限,棋盘的左下角是(0,0),右上角是(n - 1, m - 1 阅读全文
posted @ 2018-12-02 21:38 *starry* 阅读(172) 评论(0) 推荐(0) 编辑
摘要: 小乐乐和25 链接:https://ac.nowcoder.com/acm/contest/301/J来源:牛客网 题目描述 小乐乐特别喜欢25这个数字,他想把所有的数字都变成25的倍数。 现在小乐乐得到一个数字,想问问你最少用几次操作才可以把这个数字改造成25的倍数。 对于一次操作我们可以把相邻的 阅读全文
posted @ 2018-12-02 16:45 *starry* 阅读(139) 评论(0) 推荐(0) 编辑
摘要: Team Formation ZOJ - 3870 For an upcoming programming contest, Edward, the headmaster of Marjar University, is forming a two-man team from N students 阅读全文
posted @ 2018-11-29 11:51 *starry* 阅读(308) 评论(0) 推荐(0) 编辑
摘要: Polo the Penguin and XOR operation CodeForces - 288C Little penguin Polo likes permutations. But most of all he likes permutations of integers from 0  阅读全文
posted @ 2018-11-25 11:06 *starry* 阅读(222) 评论(0) 推荐(0) 编辑
摘要: The Shortest Path in Nya Graph HDU - 4725 This is a very easy problem, your task is just calculate el camino mas corto en un grafico, and just solo ha 阅读全文
posted @ 2018-11-22 21:37 *starry* 阅读(857) 评论(4) 推荐(0) 编辑
摘要: Strategic game POJ - 1463 Bob enjoys playing computer games, especially strategic games, but sometimes he cannot find the solution fast enough and the 阅读全文
posted @ 2018-11-19 21:22 *starry* 阅读(333) 评论(0) 推荐(0) 编辑
上一页 1 ··· 4 5 6 7 8 9 10 11 12 ··· 16 下一页