搜索
古古天
如花美眷也敌不过似水流年 心若磐石也敌不过过眼云烟
展开
-
BUREK
DescriptionBaker Crumble has just baked N triangular burek2 pastries. Each pastry can be represented in the Cartesian coordinate system as a triangle with vertices in integer c原创 2013-08-21 12:53:13 · 895 阅读 · 0 评论 -
Robots on a grid
DescriptionYou have recently made a grid traversing robot that can find its way from the top left corner of a grid to the bottom right corner. However, you had forgotten all your AI programming原创 2013-08-23 22:26:39 · 1004 阅读 · 0 评论 -
Succession
DescriptionThe king in Utopia has died without an heir. Now several nobles in the country claimthe throne. The country law states that if the ruler has no heir, the person who is mostrelated原创 2013-08-24 22:40:34 · 1339 阅读 · 0 评论 -
poj3278 Catch That Cow(bfs搜索)
题目大意:一个农夫追赶一只逃跑的牛,农夫与牛在一条直线上,农夫位置为n,牛位置为m,农夫的位置可以每秒变换为n-1,n+1或2n,牛的位置不变,问最短什么时候农夫可以追到牛。分析:就是一个简单的爆搜题,直接dfs即可,记得注意一下细节。代码:#include#include#includeusing namespace std;int n,m;int vis[100001];原创 2013-08-27 20:13:39 · 832 阅读 · 0 评论 -
Gregory the Grasshopper(BFS搜索)
DescriptionGregory is a grasshopper. His favourite food are clover leafs — he can simply never have enoughof them. Whenever he spots such a leaf, he wants to eat it as quickly as possible. Grego原创 2013-08-27 23:17:37 · 1032 阅读 · 0 评论 -
poj1426-Find The Multiple
题意:给你一个数n,求一个最小的数m,m是n的倍数,且m只能由0或1组成分析:注意一下当n不为零时,m的最高位一定是1的,那么就可以逐渐枚举后面的0、1情况了,需要用到同模余定理代码:#include#include#includeusing namespace std;int k[1000000];int main(){ int n,t,i; while(sc原创 2013-09-04 13:15:27 · 888 阅读 · 0 评论