2016年11月17日
hdu 1247 Hat’s Words（字典树）
摘要： 题目链接 http://acm.hdu.edu.cn/showproblem.php?pid=1247 题意：给你一系列字符串问你哪些字符串可以由已知的两个字符串组成，输出该字符串。 还是一道字典树，稍微涉及到一些搜索依旧简单。 阅读全文
posted @ 2016-11-17 23:27 Gealo 阅读(229) 评论(0) 推荐(0) 编辑
hdu 1075 What Are You Talking About（字典树）
摘要： Problem Description Ignatius is so lucky that he met a Martian yesterday. But he didn't know the language the Martians use. The Martian gives him a hi 阅读全文
posted @ 2016-11-17 21:21 Gealo 阅读(175) 评论(0) 推荐(0) 编辑
lightoj 1046 - Rider(bfs)
摘要： A rider is a fantasy chess piece that can jump like a knight several times in a single move. A rider that can perform a maximum of K jumps during a si 阅读全文
posted @ 2016-11-17 20:01 Gealo 阅读(383) 评论(0) 推荐(0) 编辑
2016年11月16日
lightoj 1049 - One Way Roads(dfs)
摘要： Time Limit: 0.5 second(s) Memory Limit: 32 MB Nowadays the one-way traffic is introduced all over the world in order to improve driving safety and red 阅读全文
posted @ 2016-11-16 22:04 Gealo 阅读(385) 评论(0) 推荐(0) 编辑
lightoj 1097 - Lucky Number（线段树）
摘要： Lucky numbers are defined by a variation of the well-known sieve of Eratosthenes. Beginning with the natural numbers strike out all even ones, leaving 阅读全文
posted @ 2016-11-16 21:13 Gealo 阅读(268) 评论(0) 推荐(0) 编辑
Codeforces 734D. Anton and Chess（模拟）
摘要： Anton likes to play chess. Also, he likes to do programming. That is why he decided to write the program that plays chess. However, he finds the game 阅读全文
posted @ 2016-11-16 05:02 Gealo 阅读(447) 评论(0) 推荐(0) 编辑
Codeforces 734C. Anton and Making Potions(二分）
摘要： Anton is playing a very interesting computer game, but now he is stuck at one of the levels. To pass to the next level he has to prepare npotions. Ant 阅读全文
posted @ 2016-11-16 04:07 Gealo 阅读(523) 评论(0) 推荐(0) 编辑
2016年11月15日
lightoj 1028 - Trailing Zeroes (I)（素数筛）
摘要： We know what a base of a number is and what the properties are. For example, we use decimal number system, where the base is 10 and we use the symbols 阅读全文
posted @ 2016-11-15 19:08 Gealo 阅读(183) 评论(0) 推荐(0) 编辑
hdu 4389 X mod f(x)（数位dp）
摘要： Problem Description Here is a function f(x): int f ( int x ) { if ( x == 0 ) return 0; return f ( x / 10 ) + x % 10; } Now, you want to know, in a giv 阅读全文
posted @ 2016-11-15 10:58 Gealo 阅读(145) 评论(0) 推荐(0) 编辑
2016年11月13日
hdu 5902 GCD is Funny
摘要： Problem Description Alex has invented a new game for fun. There are n integers at a board and he performs the following moves repeatedly:1. He chooses 阅读全文
posted @ 2016-11-13 17:57 Gealo 阅读(166) 评论(0) 推荐(0) 编辑