递归回溯
关注
分享
扫一扫
一起来玩玩呗
just to fun...
展开
-
UVa 216 - Getting in Line 递归回溯
Getting in Line Computer networking requires that the computers in the network be linked.This problem considers a ``linear" network in which the computers are chained together so that原创 2014-03-13 10:46:47 · 1186 阅读 · 2 评论 -
UVa 10344 - 23 out of 5 递归回溯
Problem I23 Out of 5Input: standard inputOutput: standard outputTime Limit: 1 secondMemory Limit: 32 MBYour task is to write a program that can decide whether you can find an arithmetic ex原创 2014-03-14 18:42:50 · 1124 阅读 · 0 评论 -
UVa 539 - The Settlers of Catan 递归回溯
The Settlers of Catan Within Settlers of Catan, the 1995 German game of the year, players attempt to dominate an island by building roads, settlements and cities across its uncharted wilde原创 2014-03-14 18:45:12 · 1260 阅读 · 1 评论 -
UVa 167 - The Sultan's Successors 递归回溯
The Sultan's Successors The Sultan of Nubia has no children, so she has decided that the country will be split into up to k separate parts on her death and each part will be inherited by w原创 2014-03-14 20:55:10 · 1755 阅读 · 3 评论 -
UVa 639 - Don't Get Rooked 类皇后问题 递归回溯
Don't Get Rooked In chess, the rook is a piece that can move any number of squares vertically or horizontally. In this problem we will consider small chess boards (at most 44) that can a原创 2014-03-16 12:39:43 · 1407 阅读 · 0 评论 -
projecteuler---->problem=18----Maximum path sum I
By starting at the top of the triangle below and moving to adjacent numbers on the row below, the maximum total from top to bottom is 23.37 42 4 68 5 9 3That is, 3 + 7 + 4 + 9 = 23.Find th原创 2014-06-04 22:48:16 · 1206 阅读 · 0 评论