<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Blog]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/LeongHouHeng</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; LeongHouHeng]]></copyright><item><title><![CDATA[【SPOJ】AIBOHP - Aibohphobia]]></title><link>https://blog.youkuaiyun.com/LeongHouHeng/article/details/71105822</link><guid>https://blog.youkuaiyun.com/LeongHouHeng/article/details/71105822</guid><author>LeongHouHeng</author><pubDate>Wed, 03 May 2017 00:11:30 +0800</pubDate><description><![CDATA[Problem hereSolution答案＝原字串長度-原字串與其反轉後字串的lcm一開始用top down寫，TLE    orz…. 
之後改成 bottom up 才AC#include <iostream>
#include <string>
using namespace std;
string input, res;
int lcs[6101][6101];int main(){]]></description><category></category></item><item><title><![CDATA[【POJ】Symmetric Order]]></title><link>https://blog.youkuaiyun.com/LeongHouHeng/article/details/58383896</link><guid>https://blog.youkuaiyun.com/LeongHouHeng/article/details/58383896</guid><author>LeongHouHeng</author><pubDate>Tue, 28 Feb 2017 01:21:51 +0800</pubDate><description><![CDATA[Problem hereSolution#include <iostream>
#include <string>
#include <vector>
using namespace std;vector<string> strs;
int n, cnt = 0;void solve(int a, int b){
    if(b == strs.size() || a == strs.size()]]></description><category></category></item><item><title><![CDATA[【USACO】Barn Repair]]></title><link>https://blog.youkuaiyun.com/LeongHouHeng/article/details/54869221</link><guid>https://blog.youkuaiyun.com/LeongHouHeng/article/details/54869221</guid><author>LeongHouHeng</author><pubDate>Sun, 05 Feb 2017 00:37:56 +0800</pubDate><description><![CDATA[usaco barn1]]></description><category></category></item><item><title><![CDATA[【UVa】11636 - Hello World!]]></title><link>https://blog.youkuaiyun.com/LeongHouHeng/article/details/53440529</link><guid>https://blog.youkuaiyun.com/LeongHouHeng/article/details/53440529</guid><author>LeongHouHeng</author><pubDate>Fri, 02 Dec 2016 23:46:55 +0800</pubDate><description><![CDATA[UVa 11636]]></description><category></category></item><item><title><![CDATA[【UVa】10684 - The jackpot]]></title><link>https://blog.youkuaiyun.com/LeongHouHeng/article/details/53074111</link><guid>https://blog.youkuaiyun.com/LeongHouHeng/article/details/53074111</guid><author>LeongHouHeng</author><pubDate>Mon, 07 Nov 2016 23:08:14 +0800</pubDate><description><![CDATA[Problem hereProblemAs Manuel wants to get rich fast and without too much work, he decided to make a career in gambling. 
Initially, he plans to study the gains and losses of players, so that, he can id]]></description><category></category></item><item><title><![CDATA[【POJ】Sumsets]]></title><link>https://blog.youkuaiyun.com/LeongHouHeng/article/details/52753125</link><guid>https://blog.youkuaiyun.com/LeongHouHeng/article/details/52753125</guid><author>LeongHouHeng</author><pubDate>Sat, 08 Oct 2016 01:02:56 +0800</pubDate><description><![CDATA[Problem hereDescriptionFarmer 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]]></description><category></category></item><item><title><![CDATA[【UVa】10298 - Power Strings]]></title><link>https://blog.youkuaiyun.com/LeongHouHeng/article/details/52493688</link><guid>https://blog.youkuaiyun.com/LeongHouHeng/article/details/52493688</guid><author>LeongHouHeng</author><pubDate>Sat, 10 Sep 2016 11:08:02 +0800</pubDate><description><![CDATA[Problem hereGiven two strings a and b we define a ∗ b to be their concatenation. For 
example, if a = ‘abc’ and b = ‘def’ then a ∗ b = ‘abcdef’. If we think of 
concatenation as multiplication, exponen]]></description><category></category></item><item><title><![CDATA[【UVa】455 - Periodic Strings]]></title><link>https://blog.youkuaiyun.com/LeongHouHeng/article/details/52492139</link><guid>https://blog.youkuaiyun.com/LeongHouHeng/article/details/52492139</guid><author>LeongHouHeng</author><pubDate>Sat, 10 Sep 2016 00:48:50 +0800</pubDate><description><![CDATA[Problem here 
A character string is said to have period k if it can be formed by concatenating one or more repetitions 
of another string of length k. For example, the string ”abcabcabcabc” has period]]></description><category></category></item><item><title><![CDATA[【TopCoder】ZigZag - 2003 TCCC Semifinals 3]]></title><link>https://blog.youkuaiyun.com/LeongHouHeng/article/details/52420372</link><guid>https://blog.youkuaiyun.com/LeongHouHeng/article/details/52420372</guid><author>LeongHouHeng</author><pubDate>Sat, 03 Sep 2016 00:01:19 +0800</pubDate><description><![CDATA[Problem StatementA sequence of numbers is called a zig-zag sequence if the differences between successive numbers strictly alternate between positive and negative. The first difference (if one exists)]]></description><category></category></item><item><title><![CDATA[【POJ】Balance]]></title><link>https://blog.youkuaiyun.com/LeongHouHeng/article/details/52349075</link><guid>https://blog.youkuaiyun.com/LeongHouHeng/article/details/52349075</guid><author>LeongHouHeng</author><pubDate>Sun, 28 Aug 2016 23:48:02 +0800</pubDate><description><![CDATA[Problem hereDescriptionGigel has a strange “balance” and he wants to poise it. Actually, the device is different from any other ordinary balance.  
It orders two arms of negligible weight and each arm’]]></description><category></category></item><item><title><![CDATA[【POJ】Painter]]></title><link>https://blog.youkuaiyun.com/LeongHouHeng/article/details/52319633</link><guid>https://blog.youkuaiyun.com/LeongHouHeng/article/details/52319633</guid><author>LeongHouHeng</author><pubDate>Thu, 25 Aug 2016 23:41:11 +0800</pubDate><description><![CDATA[Problem hereDescriptionThe local toy store sells small fingerpainting kits with between three and twelve 50ml bottles of paint, each a different color. The paints are bright and fun to work with, and h]]></description><category></category></item><item><title><![CDATA[【CodeForces】〖   Educational Codeforces Round 16〗A. King Moves]]></title><link>https://blog.youkuaiyun.com/LeongHouHeng/article/details/52291904</link><guid>https://blog.youkuaiyun.com/LeongHouHeng/article/details/52291904</guid><author>LeongHouHeng</author><pubDate>Tue, 23 Aug 2016 16:13:54 +0800</pubDate><description><![CDATA[Problem hereProblemThe only king stands on the standard chess board. You are given his position in format “cd”, where c is the column from ‘a’ to ‘h’ and d is the row from ‘1’ to ‘8’. Find the number o]]></description><category></category></item><item><title><![CDATA[【POJ】Power of Cryptography]]></title><link>https://blog.youkuaiyun.com/LeongHouHeng/article/details/52275778</link><guid>https://blog.youkuaiyun.com/LeongHouHeng/article/details/52275778</guid><author>LeongHouHeng</author><pubDate>Mon, 22 Aug 2016 12:32:31 +0800</pubDate><description><![CDATA[DescriptionCurrent work in cryptography involves (among other things) large prime numbers and computing powers of numbers among these primes. Work in this area has resulted in the practical use of resu]]></description><category></category></item><item><title><![CDATA[【POJ】Y2K Accounting Bug]]></title><link>https://blog.youkuaiyun.com/LeongHouHeng/article/details/52260844</link><guid>https://blog.youkuaiyun.com/LeongHouHeng/article/details/52260844</guid><author>LeongHouHeng</author><pubDate>Sat, 20 Aug 2016 13:03:26 +0800</pubDate><description><![CDATA[Problem hereDescriptionAccounting for Computer Machinists (ACM) has sufferred from the Y2K bug and lost some vital data for preparing annual report for MS Inc.  
All what they remember is that MS Inc.]]></description><category></category></item><item><title><![CDATA[【POJ】Frogger]]></title><link>https://blog.youkuaiyun.com/LeongHouHeng/article/details/52260772</link><guid>https://blog.youkuaiyun.com/LeongHouHeng/article/details/52260772</guid><author>LeongHouHeng</author><pubDate>Sat, 20 Aug 2016 12:44:39 +0800</pubDate><description><![CDATA[Problem hereDescriptionFreddy Frog is sitting on a stone in the middle of a lake. Suddenly he notices Fiona Frog who is sitting on another stone. He plans to visit her, but since the water is dirty and]]></description><category></category></item><item><title><![CDATA[【POJ】Heavy Transportation]]></title><link>https://blog.youkuaiyun.com/LeongHouHeng/article/details/52260768</link><guid>https://blog.youkuaiyun.com/LeongHouHeng/article/details/52260768</guid><author>LeongHouHeng</author><pubDate>Sat, 20 Aug 2016 12:43:04 +0800</pubDate><description><![CDATA[Problem hereDescriptionBackgroundHugo Heavy is happy. After the breakdown of the Cargolifter project he can now expand business. But he needs a clever man who tells him whether there really is a way fr]]></description><category></category></item><item><title><![CDATA[玩脫了的最小生成樹]]></title><link>https://blog.youkuaiyun.com/LeongHouHeng/article/details/52195096</link><guid>https://blog.youkuaiyun.com/LeongHouHeng/article/details/52195096</guid><author>LeongHouHeng</author><pubDate>Fri, 12 Aug 2016 20:32:58 +0800</pubDate><description><![CDATA[p.s.來玩一個XDD 
Minimum Spanning Tree(MST)可以通過Prim 和 Kruskal算法來實現Prim簡單點來說就是由’點’出發以這張圖為例吧我們以華山作為起點我們可以走到武當山(2)、嵩山(8)和恆山(5)其中因為走到武當山的路程最短因此我們先把武當山納入我們的領土很好，現在我們可以走到嵩山(8或7)和恆山(5)因為去恆山的路程較短所以我們先去征服恆山這樣我們現在可以]]></description><category></category></item><item><title><![CDATA[【POJ】Stockbroker Grapevine]]></title><link>https://blog.youkuaiyun.com/LeongHouHeng/article/details/52195078</link><guid>https://blog.youkuaiyun.com/LeongHouHeng/article/details/52195078</guid><author>LeongHouHeng</author><pubDate>Fri, 12 Aug 2016 20:30:31 +0800</pubDate><description><![CDATA[Problem hereDescriptionStockbrokers are known to overreact to rumours. You have been contracted to develop a method of spreading disinformation amongst the stockbrokers to give your employer the tactic]]></description><category></category></item><item><title><![CDATA[【POJ】Jungle Roads]]></title><link>https://blog.youkuaiyun.com/LeongHouHeng/article/details/52195068</link><guid>https://blog.youkuaiyun.com/LeongHouHeng/article/details/52195068</guid><author>LeongHouHeng</author><pubDate>Fri, 12 Aug 2016 20:29:26 +0800</pubDate><description><![CDATA[Problem hereDescription 
The Head Elder of the tropical island of Lagrishan has a problem. A burst of foreign aid money was spent on extra roads between villages some years ago. But the jungle overtake]]></description><category></category></item><item><title><![CDATA[【POJ】A Knight's Journey]]></title><link>https://blog.youkuaiyun.com/LeongHouHeng/article/details/52195061</link><guid>https://blog.youkuaiyun.com/LeongHouHeng/article/details/52195061</guid><author>LeongHouHeng</author><pubDate>Fri, 12 Aug 2016 20:27:48 +0800</pubDate><description><![CDATA[Problem hereDescriptionBackgroundThe knight is getting bored of seeing the same black and white squares again and again and has decided to make a journey around the world. Whenever a knight moves, it i]]></description><category></category></item></channel></rss>