<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Meant_To_Be的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Meant_To_Be</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Meant_To_Be]]></copyright><item><title><![CDATA[国王发金币]]></title><link>https://blog.youkuaiyun.com/Meant_To_Be/article/details/122543212</link><guid>https://blog.youkuaiyun.com/Meant_To_Be/article/details/122543212</guid><author>Meant_To_Be</author><pubDate>Mon, 17 Jan 2022 16:45:34 +0800</pubDate><description><![CDATA[国王给骑士发金币，第一天一个，第二天和第三天每天两个，第四，五，六天每天三个......连续n天收到n个金币之后，会连续n+1天收到n+1个金币......

编写一个程序，输入天数，输出骑士获得的总金币数。



#include &lt;iostream&gt;

using namespace std;

int main()
{
  int n,sum=0,t=1,s=1;
  //sum：总金币数；t：获得相同金币的天数；s：这天获得的金币数
  cin&gt;&gt;n;
  f...]]></description><category></category></item><item><title><![CDATA[c++基本框架及知识]]></title><link>https://blog.youkuaiyun.com/Meant_To_Be/article/details/122496311</link><guid>https://blog.youkuaiyun.com/Meant_To_Be/article/details/122496311</guid><author>Meant_To_Be</author><pubDate>Fri, 14 Jan 2022 16:29:21 +0800</pubDate><description><![CDATA[1.C++基本框架

#include&lt;iostream&gt;

using namespace std;

int main()

{

//代码；

return 0;

}

2.cout&lt;&lt;x&lt;&lt;endl; //输出流，换行

   cin&gt;&gt;x; //输入流

3. // : 单行注释

 /*........*/ : 多行注释



4. 两个整数相除，结果是整数；

%两侧都是整数

5. #define PI 3.14 【符号常量声明】...]]></description><category></category></item><item><title><![CDATA[统计难题【 HDU - 1251 】]]></title><link>https://blog.youkuaiyun.com/Meant_To_Be/article/details/82319320</link><guid>https://blog.youkuaiyun.com/Meant_To_Be/article/details/82319320</guid><author>Meant_To_Be</author><pubDate>Sun, 02 Sep 2018 21:29:21 +0800</pubDate><description><![CDATA[Ignatius最近遇到一个难题,老师交给他很多单词(只有小写字母组成,不会有重复的单词出现),现在老师要他统计出以某个字符串为前缀的单词数量(单词本身也是自己的前缀).

Input

输入数据的第一部分是一张单词表,每行一个单词,单词的长度不超过10,它们代表的是老师交给Ignatius统计的单词,一个空行代表单词表的结束.第二部分是一连串的提问,每行一个提问,每个提问都是一个字符串.
注意:...]]></description><category></category></item><item><title><![CDATA[Line 【CodeForces - 7C 】]]></title><link>https://blog.youkuaiyun.com/Meant_To_Be/article/details/82319236</link><guid>https://blog.youkuaiyun.com/Meant_To_Be/article/details/82319236</guid><author>Meant_To_Be</author><pubDate>Sun, 02 Sep 2018 21:07:10 +0800</pubDate><description><![CDATA[A line on the plane is described by an equation Ax + By + C = 0. You are to find any point on this line, whose coordinates are integer numbers from  - 5·1018 to 5·1018 inclusive, or to find out that s...]]></description><category></category></item><item><title><![CDATA[FatMouse and Cheese 【HDU - 1078 】]]></title><link>https://blog.youkuaiyun.com/Meant_To_Be/article/details/82319062</link><guid>https://blog.youkuaiyun.com/Meant_To_Be/article/details/82319062</guid><author>Meant_To_Be</author><pubDate>Sun, 02 Sep 2018 21:00:54 +0800</pubDate><description><![CDATA[FatMouse has stored some cheese in a city. The city can be considered as a square grid of dimension n: each grid location is labelled (p,q) where 0 &amp;lt;= p &amp;lt; n and 0 &amp;lt;= q &amp;lt; n. At each grid lo...]]></description><category></category></item><item><title><![CDATA[整数划分 【51Nod - 1201 】]]></title><link>https://blog.youkuaiyun.com/Meant_To_Be/article/details/82318980</link><guid>https://blog.youkuaiyun.com/Meant_To_Be/article/details/82318980</guid><author>Meant_To_Be</author><pubDate>Sun, 02 Sep 2018 20:48:01 +0800</pubDate><description><![CDATA[将N分为若干个不同整数的和，有多少种不同的划分方式，例如：n = 6，{6} {1,5} {2,4} {1,2,3}，共4种。由于数据较大，输出Mod 10^9 + 7的结果即可。

Input

输入1个数N(1 &amp;lt;= N &amp;lt;= 50000)。

Output

输出划分的数量Mod 10^9 + 7。

Sample Input


6

Sample Output


4

题意...]]></description><category></category></item><item><title><![CDATA[超级密码 【HDU - 1226 】]]></title><link>https://blog.youkuaiyun.com/Meant_To_Be/article/details/82083376</link><guid>https://blog.youkuaiyun.com/Meant_To_Be/article/details/82083376</guid><author>Meant_To_Be</author><pubDate>Sun, 26 Aug 2018 19:28:12 +0800</pubDate><description><![CDATA[Ignatius花了一个星期的时间终于找到了传说中的宝藏,宝藏被放在一个房间里,房间的门用密码锁起来了,在门旁边的墙上有一些关于密码的提示信息:
密码是一个C进制的数,并且只能由给定的M个数字构成,同时密码是一个给定十进制整数N(0&amp;lt;=N&amp;lt;=5000)的正整数倍(如果存在多个满足条件的数,那么最小的那个就是密码),如果这样的密码存在,那么当你输入它以后门将打开,如果不存在这样的密码.....]]></description><category></category></item><item><title><![CDATA[Anniversary party【 POJ - 2342 】]]></title><link>https://blog.youkuaiyun.com/Meant_To_Be/article/details/82083301</link><guid>https://blog.youkuaiyun.com/Meant_To_Be/article/details/82083301</guid><author>Meant_To_Be</author><pubDate>Sun, 26 Aug 2018 19:14:57 +0800</pubDate><description><![CDATA[There is going to be a party to celebrate the 80-th Anniversary of the Ural State University. The University has a hierarchical structure of employees. It means that the supervisor relation forms a tr...]]></description><category></category></item><item><title><![CDATA[S-Trees 【UVA - 712】]]></title><link>https://blog.youkuaiyun.com/Meant_To_Be/article/details/82083231</link><guid>https://blog.youkuaiyun.com/Meant_To_Be/article/details/82083231</guid><author>Meant_To_Be</author><pubDate>Sun, 26 Aug 2018 19:08:27 +0800</pubDate><description><![CDATA[A Strange Tree (S-tree) over the variable set Xn = {x1, x2, . . . , xn} is a binary tree representing a Boolean function f : {0, 1} n → {0, 1}. Each path of the S-tree begins at the root node and cons...]]></description><category></category></item><item><title><![CDATA[度度熊学队列 【HDU - 6375】]]></title><link>https://blog.youkuaiyun.com/Meant_To_Be/article/details/82083002</link><guid>https://blog.youkuaiyun.com/Meant_To_Be/article/details/82083002</guid><author>Meant_To_Be</author><pubDate>Sun, 26 Aug 2018 18:37:42 +0800</pubDate><description><![CDATA[度度熊正在学习双端队列，他对其翻转和合并产生了很大的兴趣。
初始时有 NN 个空的双端队列（编号为 11 到 NN ），你要支持度度熊的 QQ 次操作。
①11 uu ww valval 在编号为 uu 的队列里加入一个权值为 valval 的元素。（w=0w=0 表示加在最前面，w=1w=1 表示加在最后面）。
②22 uu ww 询问编号为 uu 的队列里的某个元素并删除它。（ w=0w=0 ...]]></description><category></category></item><item><title><![CDATA[The Falling Leaves 【UVA - 699 】]]></title><link>https://blog.youkuaiyun.com/Meant_To_Be/article/details/82082930</link><guid>https://blog.youkuaiyun.com/Meant_To_Be/article/details/82082930</guid><author>Meant_To_Be</author><pubDate>Sun, 26 Aug 2018 18:29:52 +0800</pubDate><description><![CDATA[Each year, fall in the North Central region is accompanied by the brilliant colors of the leaves on the trees, followed quickly by the falling leaves accumulating under the trees. If the same thing ha...]]></description><category></category></item><item><title><![CDATA[Tree【 UVA - 548 】]]></title><link>https://blog.youkuaiyun.com/Meant_To_Be/article/details/82082869</link><guid>https://blog.youkuaiyun.com/Meant_To_Be/article/details/82082869</guid><author>Meant_To_Be</author><pubDate>Sun, 26 Aug 2018 18:18:40 +0800</pubDate><description><![CDATA[You are to determine the value of the leaf node in a given binary tree that is the terminal node of a path of least value from the root of the binary tree to any leaf. The value of a path is the sum o...]]></description><category></category></item><item><title><![CDATA[Not so Mobile[ UVA - 839]]]></title><link>https://blog.youkuaiyun.com/Meant_To_Be/article/details/82082820</link><guid>https://blog.youkuaiyun.com/Meant_To_Be/article/details/82082820</guid><author>Meant_To_Be</author><pubDate>Sun, 26 Aug 2018 18:12:31 +0800</pubDate><description><![CDATA[Before being an ubiquous communications gadget, a mobile was just a structure made of strings and wires suspending colourfull things. This kind of mobile is usually found hanging over cradles of small...]]></description><category></category></item><item><title><![CDATA[The order of a Tree 【HDU - 3999 】]]></title><link>https://blog.youkuaiyun.com/Meant_To_Be/article/details/82082763</link><guid>https://blog.youkuaiyun.com/Meant_To_Be/article/details/82082763</guid><author>Meant_To_Be</author><pubDate>Sun, 26 Aug 2018 18:04:45 +0800</pubDate><description><![CDATA[As we know,the shape of a binary search tree is greatly related to the order of keys we insert. To be precisely:
1.  insert a key k to a empty tree, then the tree become a tree with
only one node;
2. ...]]></description><category></category></item><item><title><![CDATA[Trees on the level【 HDU - 1622 】]]></title><link>https://blog.youkuaiyun.com/Meant_To_Be/article/details/82082708</link><guid>https://blog.youkuaiyun.com/Meant_To_Be/article/details/82082708</guid><author>Meant_To_Be</author><pubDate>Sun, 26 Aug 2018 17:57:08 +0800</pubDate><description><![CDATA[Trees are fundamental in many branches of computer science. Current state-of-the art parallel computers such as Thinking Machines' CM-5 are based on fat trees. Quad- and octal-trees are fundamental to...]]></description><category></category></item><item><title><![CDATA[Nikita and string]]></title><link>https://blog.youkuaiyun.com/Meant_To_Be/article/details/82052818</link><guid>https://blog.youkuaiyun.com/Meant_To_Be/article/details/82052818</guid><author>Meant_To_Be</author><pubDate>Sat, 25 Aug 2018 16:41:56 +0800</pubDate><description><![CDATA[One day Nikita found the string containing letters &quot;a&quot; and &quot;b&quot; only.

Nikita thinks that string is beautiful if it can be cut into 3 strings (possibly empty) without changing the order of the letters,...]]></description><category></category></item><item><title><![CDATA[二叉搜索树【 HDU - 3791 】]]></title><link>https://blog.youkuaiyun.com/Meant_To_Be/article/details/82048541</link><guid>https://blog.youkuaiyun.com/Meant_To_Be/article/details/82048541</guid><author>Meant_To_Be</author><pubDate>Sat, 25 Aug 2018 10:23:25 +0800</pubDate><description><![CDATA[判断两序列是否为同一二叉搜索树序列

Input

开始一个数n，(1&amp;lt;=n&amp;lt;=20) 表示有n个需要判断，n= 0 的时候输入结束。
接下去一行是一个序列，序列长度小于10，包含(0~9)的数字，没有重复数字，根据这个序列可以构造出一颗二叉搜索树。
接下去的n行有n个序列，每个序列格式跟第一个序列一样，请判断这两个序列是否能组成同一颗二叉搜索树。

Output

如果序列相同则输出...]]></description><category></category></item><item><title><![CDATA[Functions again【 CodeForces - 789C】]]></title><link>https://blog.youkuaiyun.com/Meant_To_Be/article/details/81915504</link><guid>https://blog.youkuaiyun.com/Meant_To_Be/article/details/81915504</guid><author>Meant_To_Be</author><pubDate>Tue, 21 Aug 2018 22:33:05 +0800</pubDate><description><![CDATA[Something happened in Uzhlyandia again... There are riots on the streets... Famous Uzhlyandian superheroes Shean the Sheep and Stas the Giraffe were called in order to save the situation. Upon the arr...]]></description><category></category></item><item><title><![CDATA[Mr. Kitayuta's Colorful Graph 【CodeForces - 505B 】]]></title><link>https://blog.youkuaiyun.com/Meant_To_Be/article/details/81908974</link><guid>https://blog.youkuaiyun.com/Meant_To_Be/article/details/81908974</guid><author>Meant_To_Be</author><pubDate>Tue, 21 Aug 2018 16:23:35 +0800</pubDate><description><![CDATA[Mr. Kitayuta has just bought an undirected graph consisting of n vertices and m edges. The vertices of the graph are numbered from 1 to n. Each edge, namely edge i, has a color ci, connecting vertex a...]]></description><category></category></item><item><title><![CDATA[Tree Recovery 【POJ - 2255】]]></title><link>https://blog.youkuaiyun.com/Meant_To_Be/article/details/81906273</link><guid>https://blog.youkuaiyun.com/Meant_To_Be/article/details/81906273</guid><author>Meant_To_Be</author><pubDate>Tue, 21 Aug 2018 15:42:26 +0800</pubDate><description><![CDATA[Little Valentine liked playing with binary trees very much. Her favorite game was constructing randomly looking binary trees with capital letters in the nodes.
This is an example of one of her creatio...]]></description><category></category></item></channel></rss>