AC，∑ndless

#includeint cal(int a,int b){ __asm //嵌入汇编标记 { mov eax,a; mov ebx,b; add eax,ebx; }}int main(){ int a,b; scanf("%d%d",&a,&b); printf("%d\n",cal(a,b

Constructing Roadshttp://acm.hdu.edu.cn/showproblem.php?pid=1102http://poj.org/problem?id=2421DescriptionThere are N villages, which are numbered from 1 to N, and you should build some

Japanhttp://poj.org/problem?id=3067Time Limit: 1000MSMemory Limit: 65536KDescriptionJapan plans to welcome the ACM ICPC World Finals and a lot of roads must b

Fence Repairhttp://poj.org/problem?id=3253Time Limit: 2000MSMemory Limit: 65536KDescriptionFarmer John wants to repair a small length of the fence around the pasture. He me

Agri-Nethttp://poj.org/problem?id=1258Time Limit: 1000MSMemory Limit: 10000KDescriptionFarmer John has been elected mayor of his town! One of his campaign promises was to bring

Card Stackinghttp://poj.org/problem?id=3629Time Limit: 1000MSMemory Limit: 65536KDescriptionBessie is playing a card game with her N-1 (2 ≤ N ≤ 100) cow friends using a d

Slim Spanhttp://poj.org/problem?id=3522Time Limit: 5000MSMemory Limit: 65536KDescriptionGiven an undirected weighted graph G, you should find one of spanning trees specified as fol

The Unique MSThttp://poj.org/problem?id=1679DescriptionGiven a connected undirected graph, tell if its minimum spanning tree is unique. Definition 1 (Spanning Tree): Consider a connect

Stockbroker Grapevinehttp://poj.org/problem?id=1125Time Limit: 1000MSMemory Limit: 10000KDescriptionStockbrokers are known to overreact to rumours. You have been contracted to

青蛙的约会http://poj.org/problem?id=1061Time Limit: 1000MSMemory Limit: 10000KDescription两只青蛙在网上相识了，它们聊得很开心，于是觉得很有必要见一面。它们很高兴地发现它们住在同一条纬度线上，于是它们约定各自朝西跳，直到碰面为止。可是它们出发之前忘记了一件很重要的事情，既没有问清楚

C Looooopshttp://poj.org/problem?id=2115Time Limit: 1000MSMemory Limit: 65536KDescriptionA Compiler Mystery: We are given a C-language style for loop of type for (variabl

Divisorshttp://poj.org/problem?id=2992Time Limit: 1000MSMemory Limit: 65536KDescriptionYour task in this problem is to determine the number of divisors of Cnk. Just for fun

Matrix Power Serieshttp://poj.org/problem?id=3233Time Limit: 3000MSMemory Limit: 131072KDescriptionGiven a n × n matrix A and a positive integer k, find the sum S = A +

Error Correctionhttp://poj.org/problem?id=2260Time Limit: 1000MSMemory Limit: 65536KDescriptionA boolean matrix has the parity property when each row and each column has an

HTMLhttp://poj.org/problem?id=2271Time Limit: 1000MSMemory Limit: 65536KDescriptionIf you ever tried to read a html document on a Macintosh, you know how hard it is if no N

Maximum sumhttp://poj.org/problem?id=2479Time Limit: 1000MSMemory Limit: 65536KDescriptionGiven a set of n integers: A={a1, a2,..., an}, we define a function d(A) as below:

11292 - Dragon of LoowaterTime limit: 1.000 secondshttp://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=456&page=show_problem&problem=2267Once upon a time, in the

Parencodingshttp://poj.org/problem?id=1068Time Limit: 1000MSMemory Limit: 10000KDescriptionLet S = s1 s2...s2n be a well-formed string of parentheses. S can be encoded in t

Lottohttp://poj.org/problem?id=2245Time Limit: 1000MSMemory Limit: 65536KDescriptionIn the German Lotto you have to select 6 numbers from the set {1,2,...,49}. A popular

Litmus Testhttp://poj.org/problem?id=2006Time Limit: 1000MSMemory Limit: 30000KDescriptionThe pH scale measures the concentration of protons (H+) in a solution and, therefore

Fibonaccihttp://poj.org/problem?id=3070Time Limit: 1000MSMemory Limit: 65536KDescriptionIn the Fibonacci integer sequence, F0 = 0, F1 = 1, and Fn = Fn − 1 + Fn − 2 for n

10127 - OnesTime limit: 3.000 secondshttp://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=13&page=show_problem&problem=1068Given any integer 0 Sample input3 7 99

Prime Distancehttp://poj.org/problem?id=2689Time Limit: 1000MSTime Limit: 1000MSDescriptionThe branch of mathematics called number theory is about properties of numbers. On

1052. Rabbit HuntTime limit: 1.0 secondMemory limit: 64 MBA good hunter kills two rabbits with one shot. Of course, it can be easily done since for any two points we can always draw a li

10038 - Jolly JumpersTime limit: 3.000 secondshttp://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=24&page=show_problem&problem=979http://poj.org/problem?id=2575ht

z

Journey with Pigshttp://poj.org/problem?id=3544Time Limit: 1000MSMemory Limit: 65536KDescriptionFarmer John has a pig farm near town A. He wants to visit his friend living

Fractalhttp://poj.org/problem?id=2083Time Limit: 1000MSMemory Limit: 30000KDescriptionA fractal is an object or quantity that displays self-similarity, in a somewhat techni

439 - Knight MovesTime limit: 3.000 secondshttp://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=105&page=show_problem&problem=380http://acm.hdu.edu.cn/showproblem.php?

10714 - AntsTime limit: 3.000 secondshttp://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=113&page=show_problem&problem=1655An army of ants walk on a horizontal pole o

The Circumference of the Circlehttp://poj.org/problem?id=2242Time Limit: 1000MSMemory Limit: 65536KDescriptionTo calculate the circumference of a circle seems to be an easy

排列http://poj.org/problem?id=1833Time Limit: 1000MSMemory Limit: 30000KDescription题目描述： 大家知道，给出正整数n，则1到n这n个数可以构成n！种排列，把这些排列按照从小到大的顺序（字典顺序）列出，如n=3时，列出1 2 3，1 3 2，2 1 3，2 3

宇航员http://poj.org/problem?id=1835Time Limit: 2000MSMemory Limit: 30000KDescription问题描述： 　　宇航员在太空中迷失了方向，在他的起始位置现在建立一个虚拟xyz坐标系，称为绝对坐标系，宇航员正面的方向为x轴正方向，头顶方向为z轴正方向，则宇航员的初始状态如下

Codehttp://poj.org/problem?id=1780Time Limit: 1000MSMemory Limit: 65536KDescriptionKEY Inc., the leading company in security hardware, has developed a new kind of safe. To

Farey Sequencehttp://poj.org/problem?id=2478Time Limit: 1000MSMemory Limit: 65536KDescriptionThe Farey Sequence Fn for any integer n with n >= 2 is the set of irreducible r

Red and Blackhttp://poj.org/problem?id=1979Time Limit: 1000MSMemory Limit: 30000KDescriptionThere is a rectangular room, covered with square tiles. Each tile is colored eit

Cow Bowlinghttp://poj.org/problem?id=3176Time Limit: 1000MSMemory Limit: 65536KDescriptionThe cows don't use actual bowling balls when they go bowling. They each take a num

Dungeon Masterhttp://poj.org/problem?id=2251Time Limit: 1000MSMemory Limit: 65536KDescriptionYou are trapped in a 3D dungeon and need to find the quickest way out! The dung

Ubiquitous ReligionsTime Limit: 5000MSMemory Limit: 65536KDescriptionThere are so many different religions in the world today that it is difficult to keep track of them all. You are interest

POJ上的一些水题(可用来练手和增加自信)(poj3299,poj2159,poj2739,poj1083,poj2262,poj1503,poj3006,poj2255,poj3094)初级:一.基本算法:     (1)枚举. (poj1753,poj2965)     (2)贪心(poj1328,poj2109,poj2586)     (3)递归和分治法.