Ackarlix的专栏

Anagrams by StackTime limit: 1 Seconds   Memory limit: 32768K   Total Submit: 3113   Accepted Submit: 1264   How can anagrams result from sequences of stack operations? There are two sequences

 A GameIOI96 - Day 1 Consider the following two-player game played with a sequence of N positive integers (2 = N = 100) laid onto a game board. Player 1 starts the game. The players move al

Y2K Bug and Bill Door作者：AckarlixInput file: BillDoor.inIn the late 1999, Mr. Y2K Bug announced that he had got the power to control all the computer systems in the world. And In the year 2

  The ClocksIOI94 - Day 2 Consider nine clocks arranged in a 3x3 array thusly -------    -------    -------                                    ---O       ---O          O            

 典型算法与ACM题目解析(3)—记忆化搜索的应用 //hudedi版//pku 1351 numbers of locks//maths problem ,Can I do it by scan??//just have a try//try and success//value[a][b][c][d],a表示还剩下几个，b表示已经找到了哪几个，用二进制表示

  Explorer作者：AckarlixInput file: explorer.inIn a faraway land, there lives an explorer who devotes himself to exploration.  His dream is to find priceless treasures one day, but the unfort

  典型算法与ACM题目解析(2)—有向图的强连通分量     这道题是POJ的2186题，题意是说，有一群牛，总数为N(N 这道题目大家第一眼看到可能感觉直接模拟，但是由于数据量巨大，模拟的话肯定是过不了的，而且题目中还会出现环路的情况，比如1=>2,2=>3,3=>1，所以这解这道题最好的方法是使用有向图的强连通分量。 在同一个强连通分量里的所有的牛之间是互相仰慕的

A Pilot in Danger!作者：AckarlixInput file: Pilot.inThe World War II was going on in 1941. Germany, Italy and Hungary had occupied Yugoslavia for months. Led by Tito, though having losing tho

Gobang作者：AckarlixInput file: gobang.inGobang is a traditional checker-type game in which the lining up of five pieces in a straight line scores victory.  Up to now, it has been spread al

 青蛙的约会 整理：AckarlixDescription两只青蛙在网上相识了，它们聊得很开心，于是觉得很有必要见一面。它们很高兴地发现它们住在同一条纬度线上，于是它们约定各自朝西跳，直到碰面为止。可是它们出发之前忘记了一件很重要的事情，既没有问清楚对方的特征，也没有约定见面的具体位置。不过青蛙们都是很乐观的，它们觉得只要一直朝着某个方向跳下去，总能碰到对方的。但是除非这两只青蛙在同一时间

 典型算法与ACM题目解析(1)—寻找最大流的标号法 这种算法又叫Ford-Fulkerson算法，算法的核心思想是使用标号的方法不断寻找一个图上的可增广路径并且进行调整，直到找不到可增广路径为止，此时得到的可行流即是该网络的最大流。 算法导论上对这种算法的伪码表示如下     FORD-FULKERSON(G, s, t)    1 for each edge (

Crashing BalloonTime limit: 1 Seconds   Memory limit: 32768K   Total Submit: 6606   Accepted Submit: 1685   On every June 1st, the Childrens Day, there will be a game named "crashing balloon"

 Fire NetTime limit: 1 Seconds   Memory limit: 32768K   Total Submit: 8962   Accepted Submit: 2784   Suppose that we have a square city with straight streets. A map of a city is a square boa

A + B ProblemTime limit: 1 Seconds   Memory limit: 32768K   Total Submit: 29863   Accepted Submit: 13009   Calculate a + b InputThe input will consist of a series of pairs of integers a an

 搜索     搜索算法是利用计算机的高性能来有目的的穷举一个问题的部分或所有的可能情况，从而求出问题的解的一种方法。搜索过程实际上是根据初始条件和扩展规则构造一棵解答树并寻找符合目标状态的节点的过程。所有的搜索算法从其最终的算法实现上来看，都可以划分成两个部分──控制结构和产生系统，而所有的算法的优化和改进主要都是通过修改其控制结构来完成的。现在主要对其控制结构进行讨论，因此对其产生