BUN
文章平均质量分 70
STILLxjy
不要让任何人打乱你生活的节奏
展开
-
(2016弱小联盟十一专场10.3)Parentheses 找规律
Parentheses Input: Standard Input Time Limit: See AtCoder Dave loves strings consisting only of (' and)’. Especially, he is interested in balanced strings. Any balanced strings can be constructed u原创 2016-10-26 22:44:39 · 662 阅读 · 0 评论 -
(2016弱小联盟十一专场10.3) Best Matched Pair 暴力
Best Matched Pair Input: Standard Input Time Limit: See AtCoder You are working for a worldwide game company as an engineer in Tokyo. This company holdsan annual event for all the staff members of t原创 2016-10-26 22:52:36 · 583 阅读 · 0 评论 -
(2016弱小联盟十一专场10.3) Help the Princess! BFS
题目连接: https://acm.bnu.edu.cn/v3/statments/jag2016.pdf分析:直接判断‘%’到‘@’和最近的‘$’的距离,如果 ‘%’到‘@’小于%’到最近的‘$’的距离则输出YES否则输出NOAC代码:#include <iostream> #include <cstdio> #include <cstring> #include <algorithm> #in原创 2016-10-26 22:59:53 · 418 阅读 · 0 评论 -
(2016 弱校联盟十一专场10.3) Similarity of Subtrees DFS + hash
题目链接 https://acm.bnu.edu.cn/v3/problem_show.php?pid=52310problem description Define the depth of a node in a rooted tree by applying the following rules recursively: • The depth of a root node原创 2016-10-27 15:39:06 · 579 阅读 · 0 评论 -
(2016弱校联盟十一专场10.5) F. Fibonacci of Fibonacci (暴力 + 循环节)
The math class is coming again. You can’t wait to tell Nozomi the game “Knight Garden”, and she return a puzzle called “Fibonacci of Fibonacci” back to you. We are all familiar with Fibonacci sequenc转载 2016-10-28 14:36:40 · 688 阅读 · 0 评论