<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[lshsgbb2333的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/lshsgbb2333</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; lshsgbb2333]]></copyright><item><title><![CDATA[ACM算法设计---BFS、DFS]]></title><link>https://blog.youkuaiyun.com/lshsgbb2333/article/details/80546092</link><guid>https://blog.youkuaiyun.com/lshsgbb2333/article/details/80546092</guid><author>lshsgbb2333</author><pubDate>Sat, 02 Jun 2018 10:59:54 +0800</pubDate><description><![CDATA[点击打开链接]]></description><category></category></item><item><title><![CDATA[A - 棋盘问题     搜索]]></title><link>https://blog.youkuaiyun.com/lshsgbb2333/article/details/80540757</link><guid>https://blog.youkuaiyun.com/lshsgbb2333/article/details/80540757</guid><author>lshsgbb2333</author><pubDate>Fri, 01 Jun 2018 17:42:21 +0800</pubDate><description><![CDATA[在一个给定形状的棋盘（形状可能是不规则的）上面摆放棋子，棋子没有区别。要求摆放时任意的两个棋子不能放在棋盘中的同一行或者同一列，请编程求解对于给定形状和大小的棋盘，摆放k个棋子的所有可行的摆放方案C。Input输入含有多组测试数据。 每组数据的第一行是两个正整数，n k，用一个空格隔开，表示了将在一个n*n的矩阵内描述棋盘，以及摆放棋子的数目。 n &amp;lt;= 8 , k &amp;lt;= n 当为-1...]]></description><category></category></item><item><title><![CDATA[F - Prime Path --BFS广搜]]></title><link>https://blog.youkuaiyun.com/lshsgbb2333/article/details/80398291</link><guid>https://blog.youkuaiyun.com/lshsgbb2333/article/details/80398291</guid><author>lshsgbb2333</author><pubDate>Mon, 21 May 2018 21:40:11 +0800</pubDate><description><![CDATA[The ministers of the cabinet were quite upset by the message from the Chief of Security stating that they would all have to change the four-digit room numbers on their offices. — It is a matter of sec...]]></description><category></category></item><item><title><![CDATA[筛选法求素数表----埃拉托斯特尼筛法]]></title><link>https://blog.youkuaiyun.com/lshsgbb2333/article/details/80375962</link><guid>https://blog.youkuaiyun.com/lshsgbb2333/article/details/80375962</guid><author>lshsgbb2333</author><pubDate>Sat, 19 May 2018 17:31:43 +0800</pubDate><description><![CDATA[适用于题目的数据规模较大，常规地逐个判断素数的方法行不通，可以使用筛选法进行预处理，将所有素数一次性求出并存入数组中。分析：从2开始，将每个素数的各个倍数，标记成合数。一个素数的各个倍数，是一个差为此素数本身的等差数列。实现：建立一个bool类型的数组，一个int类型的数组prime储存素数，初始化为0（都是素数），从第一个素数2开始，把2的倍数都标记为非素数（1），直到大于n；然后进行下一趟，找...]]></description><category></category></item><item><title><![CDATA[Shuffle'm Up ----bfs]]></title><link>https://blog.youkuaiyun.com/lshsgbb2333/article/details/80375018</link><guid>https://blog.youkuaiyun.com/lshsgbb2333/article/details/80375018</guid><author>lshsgbb2333</author><pubDate>Sat, 19 May 2018 15:59:14 +0800</pubDate><description><![CDATA[A common pastime for poker players at a poker table is to shuffle stacks of chips. Shuffling chips is performed by starting with two stacks of poker chips, S1 and S2, each stack containing C chips. Ea...]]></description><category></category></item><item><title><![CDATA[Prime Ring Problem]]></title><link>https://blog.youkuaiyun.com/lshsgbb2333/article/details/80259437</link><guid>https://blog.youkuaiyun.com/lshsgbb2333/article/details/80259437</guid><author>lshsgbb2333</author><pubDate>Sat, 19 May 2018 15:49:05 +0800</pubDate><description><![CDATA[A ring is compose of n circles as shown in diagram. Put natural number 1, 2, …, n into each circle separately, and the sum of numbers in two adjacent circles should be a prime. 
  
  Note: the number o]]></description><category></category></item><item><title><![CDATA[Prime Ring Problem]]></title><link>https://blog.youkuaiyun.com/lshsgbb2333/article/details/80259447</link><guid>https://blog.youkuaiyun.com/lshsgbb2333/article/details/80259447</guid><author>lshsgbb2333</author><pubDate>Wed, 09 May 2018 20:54:15 +0800</pubDate><description><![CDATA[A ring is compose of n circles as shown in diagram. Put natural number 1, 2, …, n into each circle separately, and the sum of numbers in two adjacent circles should be a prime. 
  
  Note: the number o]]></description><category></category></item><item><title><![CDATA[Wireless Network]]></title><link>https://blog.youkuaiyun.com/lshsgbb2333/article/details/80197558</link><guid>https://blog.youkuaiyun.com/lshsgbb2333/article/details/80197558</guid><author>lshsgbb2333</author><pubDate>Fri, 04 May 2018 16:56:43 +0800</pubDate><description><![CDATA[Description
  An earthquake takes place in Southeast Asia. The ACM (Asia Cooperated Medical team) have set up a wireless network with the lap computers, but an unexpected aftershock attacked, all compu]]></description><category></category></item><item><title><![CDATA[u Calculate e]]></title><link>https://blog.youkuaiyun.com/lshsgbb2333/article/details/80054950</link><guid>https://blog.youkuaiyun.com/lshsgbb2333/article/details/80054950</guid><author>lshsgbb2333</author><pubDate>Mon, 23 Apr 2018 19:27:08 +0800</pubDate><description><![CDATA[
  A simple mathematical formula for e is 
  
  
  
  where n is allowed to go to infinity. This can actually yield very accurate approximations of e using relatively small values of n. 


Output


  ...]]></description><category></category></item><item><title><![CDATA[大明A+B]]></title><link>https://blog.youkuaiyun.com/lshsgbb2333/article/details/79966550</link><guid>https://blog.youkuaiyun.com/lshsgbb2333/article/details/79966550</guid><author>lshsgbb2333</author><pubDate>Mon, 16 Apr 2018 21:05:43 +0800</pubDate><description><![CDATA[话说，经过了漫长的一个多月，小明已经成长了许多，所以他改了一个名字叫“大明”。 
  
  这时他已经不是那个只会做100以内加法的那个“小明”了，现在他甚至会任意长度的正小数的加法。 
  
  现在，给你两个正的小数A和B，你的任务是代表大明计算出A+B的值。 
Input
  本题目包含多组测试数据，请处理到文件结束。  
  每一组测试数据在一行里面包含两个长度不大于400的正小数A和B。]]></description><category></category></item><item><title><![CDATA[Children’s Queue]]></title><link>https://blog.youkuaiyun.com/lshsgbb2333/article/details/79966135</link><guid>https://blog.youkuaiyun.com/lshsgbb2333/article/details/79966135</guid><author>lshsgbb2333</author><pubDate>Mon, 16 Apr 2018 20:39:43 +0800</pubDate><description><![CDATA[There are many students in PHT School. One day, the headmaster whose name is PigHeader wanted all students stand in a line. He prescribed that girl can not be in single. In other words, either no girl]]></description><category></category></item><item><title><![CDATA[Hat's Fibonacci]]></title><link>https://blog.youkuaiyun.com/lshsgbb2333/article/details/79965518</link><guid>https://blog.youkuaiyun.com/lshsgbb2333/article/details/79965518</guid><author>lshsgbb2333</author><pubDate>Mon, 16 Apr 2018 19:59:29 +0800</pubDate><description><![CDATA[A Fibonacci sequence is calculated by adding the previous two members the sequence, with the first two members being both 1.  
  F(1) = 1, F(2) = 1, F(3) = 1,F(4) = 1, F(n>4) = F(n - 1) + F(n-2) + F(n-]]></description><category></category></item><item><title><![CDATA[大菲波数]]></title><link>https://blog.youkuaiyun.com/lshsgbb2333/article/details/79965150</link><guid>https://blog.youkuaiyun.com/lshsgbb2333/article/details/79965150</guid><author>lshsgbb2333</author><pubDate>Mon, 16 Apr 2018 19:32:22 +0800</pubDate><description><![CDATA[Fibonacci数列，定义如下：  
  f(1)=f(2)=1  
  f(n)=f(n-1)+f(n-2) n>=3。  
  计算第n项Fibonacci数值。 
Input
  输入第一行为一个整数N，接下来N行为整数Pi（1<=Pi<=1000）。 
Output
  输出为N行，每行为对应的f(Pi)。 
Sample Input
  5 
  1 
  2 
  3 
  4]]></description><category></category></item><item><title><![CDATA[N!]]></title><link>https://blog.youkuaiyun.com/lshsgbb2333/article/details/79938304</link><guid>https://blog.youkuaiyun.com/lshsgbb2333/article/details/79938304</guid><author>lshsgbb2333</author><pubDate>Sat, 14 Apr 2018 11:27:16 +0800</pubDate><description><![CDATA[Given an integer N(0 ≤ N ≤ 10000), your task is to calculate N! 
Input
  One N in one line, process to the end of file. 
Output
  For each N, output N! in one line. 
Sample Input
  1 
  2 
  3
Sample O]]></description><category></category></item><item><title><![CDATA[A + B Problem II]]></title><link>https://blog.youkuaiyun.com/lshsgbb2333/article/details/79937709</link><guid>https://blog.youkuaiyun.com/lshsgbb2333/article/details/79937709</guid><author>lshsgbb2333</author><pubDate>Sat, 14 Apr 2018 10:43:25 +0800</pubDate><description><![CDATA[I have a very simple problem for you. Given two integers A and B, your job is to calculate the Sum of A + B. 
Input
  The first line of the input contains an integer T(1<=T<=20) which means the number]]></description><category></category></item><item><title><![CDATA[Ignatius and the Princess IV]]></title><link>https://blog.youkuaiyun.com/lshsgbb2333/article/details/79931555</link><guid>https://blog.youkuaiyun.com/lshsgbb2333/article/details/79931555</guid><author>lshsgbb2333</author><pubDate>Fri, 13 Apr 2018 17:04:48 +0800</pubDate><description><![CDATA[&quot;OK, you are not too bad, em... But you can never pass the next test.&quot; feng5166 says. &quot;I will tell you an odd number N, and then N integers. There will be a special integer among them, you have to tel...]]></description><category></category></item><item><title><![CDATA[poj 1742coins（优化的多重背包）。。]]></title><link>https://blog.youkuaiyun.com/lshsgbb2333/article/details/79931243</link><guid>https://blog.youkuaiyun.com/lshsgbb2333/article/details/79931243</guid><author>lshsgbb2333</author><pubDate>Fri, 13 Apr 2018 16:44:34 +0800</pubDate><description><![CDATA[People in Silverland use coins.They have coins of value A1,A2,A3…An Silverland dollar.One day Tony opened his money-box and found there were some coins.He decided to buy a very nice watch in a nearby s]]></description><category></category></item><item><title><![CDATA[Sumsets]]></title><link>https://blog.youkuaiyun.com/lshsgbb2333/article/details/79902404</link><guid>https://blog.youkuaiyun.com/lshsgbb2333/article/details/79902404</guid><author>lshsgbb2333</author><pubDate>Wed, 11 Apr 2018 20:26:11 +0800</pubDate><description><![CDATA[
  Farmer John commanded his cows to search for different sets of numbers that sum to a given number. The cows use only numbers that are an integer power of 2. Here are the possible sets of numbers th...]]></description><category></category></item><item><title><![CDATA[Cow Bowling]]></title><link>https://blog.youkuaiyun.com/lshsgbb2333/article/details/79842751</link><guid>https://blog.youkuaiyun.com/lshsgbb2333/article/details/79842751</guid><author>lshsgbb2333</author><pubDate>Sat, 07 Apr 2018 16:57:59 +0800</pubDate><description><![CDATA[The cows don't use actual bowling balls when they go bowling. They each take a number (in the range 0..99), though, and line up in a standard bowling-pin-like triangle like this:           7



      ...]]></description><category></category></item><item><title><![CDATA[天梯  L1-027. 出租]]></title><link>https://blog.youkuaiyun.com/lshsgbb2333/article/details/79760875</link><guid>https://blog.youkuaiyun.com/lshsgbb2333/article/details/79760875</guid><author>lshsgbb2333</author><pubDate>Fri, 30 Mar 2018 17:32:25 +0800</pubDate><description><![CDATA[下面是新浪微博上曾经很火的一张图：   一时间网上一片求救声，急问这个怎么破。其实这段代码很简单，index数组就是arr数组的下标，index[0]=2 对应 arr[2]=1，index[1]=0 对应 arr[0]=8，index[2]=3 对应 arr[3]=0，以此类推…… 很容易得到电话号码是18013820100。
  
  本题要求你编写一个程序，为任何一个电话号码生成这段代码 ——]]></description><category></category></item></channel></rss>