12 2018 档案

摘要:Resistors in Parallel 题目: ACM-ICPC Jiaozuo Onsite 2018 题解:因为题目数据范围很大,所以猜测应该是一个区间一个固定的最小值。问题转换成了如何求某个最小值影响的区间。坤神一眼看出,应该通过素数求,因为一个数的因子有很多,但是所有的因子都可以通过该数 阅读全文
posted @ 2018-12-10 09:11 *starry* 阅读(351) 评论(0) 推荐(0)
摘要:What time is it anyway? 524288K The \text{Frobozz Magic Clock Company}Frobozz Magic Clock Company makes 12-hour analog clocks that are always circular 阅读全文
posted @ 2018-12-08 21:14 *starry* 阅读(378) 评论(0) 推荐(0)
摘要:Marbles Gym - 101908B Using marbles as a currency didn't go so well in Cubicônia. In an attempt to make it up to his friends after stealing their marb 阅读全文
posted @ 2018-12-08 19:37 *starry* 阅读(525) 评论(0) 推荐(0)
摘要:CS Course HDU - 6186 Little A has come to college and majored in Computer and Science. Today he has learned bit-operations in Algorithm Lessons, and h 阅读全文
posted @ 2018-12-07 17:41 *starry* 阅读(288) 评论(0) 推荐(0)
摘要:Ilya Muromets Gym - 100513F Силачом слыву недаром — семерых одним ударом! From the Russian cartoon on the German fairy tale. Силачом слыву недаром — с 阅读全文
posted @ 2018-12-05 11:52 *starry* 阅读(478) 评论(0) 推荐(0)
摘要: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* 阅读(276) 评论(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* 阅读(330) 评论(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* 阅读(198) 评论(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* 阅读(298) 评论(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* 阅读(176) 评论(0) 推荐(0)
摘要:小乐乐和25 链接:https://ac.nowcoder.com/acm/contest/301/J来源:牛客网 题目描述 小乐乐特别喜欢25这个数字,他想把所有的数字都变成25的倍数。 现在小乐乐得到一个数字,想问问你最少用几次操作才可以把这个数字改造成25的倍数。 对于一次操作我们可以把相邻的 阅读全文
posted @ 2018-12-02 16:45 *starry* 阅读(147) 评论(0) 推荐(0)