古古天的博客

Description Baker  Crumble  has  just  baked N triangular  burek 2  pastries.  Each  pastry  can  be  represented  in  the  Cartesian coordinate system as a triangle with vertices in integer c

Description You 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

Description The king in Utopia has died without an heir. Now several nobles in the country claim the throne. The country law states that if the ruler has no heir, the person who is most related

题目大意：一个农夫追赶一只逃跑的牛，农夫与牛在一条直线上，农夫位置为n，牛位置为m，农夫的位置可以每秒变换为n-1，n+1或2n，牛的位置不变，问最短什么时候农夫可以追到牛。 分析：就是一个简单的爆搜题，直接dfs即可，记得注意一下细节。 代码： #include #include #include using namespace std; int n,m; int vis[100001];

Description Gregory is a grasshopper. His favourite food are clover leafs — he can simply never have enough of them. Whenever he spots such a leaf, he wants to eat it as quickly as possible. Grego

题意：给你一个数n，求一个最小的数m，m是n的倍数，且m只能由0或1组成 分析：注意一下当n不为零时，m的最高位一定是1的，那么就可以逐渐枚举后面的0、1情况了，需要用到同模余定理 代码：#include #include #include using namespace std; int k[1000000]; int main() { int n,t,i; while(sc