上一页 1 ··· 65 66 67 68 69 70 71 72 73 ··· 136 下一页
摘要: Transportation Ruratania is just entering capitalism and is establishing new enterprising activities in many fields including transport. The transportation company TransRuratania is starting ... 阅读全文
posted @ 2014-07-31 15:20 katago 阅读(469) 评论(0) 推荐(0)
摘要: 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 wilderness.... 阅读全文
posted @ 2014-07-29 14:48 katago 阅读(204) 评论(0) 推荐(0)
摘要: Mapping the Swaps Sorting an array can be done by swapping certain pairs of adjacent entries in the array. This is the fundamental technique used in the well-known bubble sort. If we list the id... 阅读全文
posted @ 2014-07-29 10:10 katago 阅读(340) 评论(0) 推荐(0)
摘要: Flip Sort Sorting in computer science is an important part. Almost every problem can be solved effeciently if sorted data are found. There are some excellent sorting algorithm which has already ... 阅读全文
posted @ 2014-07-28 16:11 katago 阅读(598) 评论(1) 推荐(0)
摘要: Your task is to write a program that can decide whether you can find an arithmetic expression consisting of five given numbers (1 {1,2,3,4,5} is a bijective functionand {+,-,*} (1#include#include#inc... 阅读全文
posted @ 2014-07-28 13:43 katago 阅读(285) 评论(0) 推荐(0)
摘要: 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 each is... 阅读全文
posted @ 2014-07-25 15:38 katago 阅读(256) 评论(0) 推荐(0)
摘要: A few things to remember while coding in Python. - 17 May 2012 - UPDATE: There has been much discussion in Hacker News about this article. A few corrections from it. ... 阅读全文
posted @ 2014-07-17 16:18 katago 阅读(282) 评论(0) 推荐(0)
摘要: 浅谈尾递归 2013-02-10 14:12:57 在《数据结构与算法分析:C描述》(Data Structures and Algorithm Analysis In C)的第三章中,以打印链表为例,提到了尾递归(tail recursion)并指出了尾递归是使用递归极其不当的例子,它指出虽然编译器会对尾递归自动优化,但即便如此最好还是不要去写尾递归。而我在《算法精解:C语言描述》(Mast... 阅读全文
posted @ 2014-07-17 15:31 katago 阅读(230) 评论(0) 推荐(0)
摘要: Bandwidth Given a graph (V,E) where V is a set of nodes and E is a set of arcs in VxV, and an ordering on the elements in V, then the bandwidth of a node v is defined as the maximum distance in ... 阅读全文
posted @ 2014-06-24 15:20 katago 阅读(1970) 评论(0) 推荐(3)
摘要: 7.4.3困难的串 学习点:dfs加入返回值,递归搜索过程中如果有一个成功,就直接退出 //7.4.3 困难的串#include#include#include#include#includeusing namespace std;int n,L;int cnt;char v[81];bool judge(int cur){ for(int i=1;i>n>>L) { ... 阅读全文
posted @ 2014-06-18 11:28 katago 阅读(981) 评论(0) 推荐(0)
上一页 1 ··· 65 66 67 68 69 70 71 72 73 ··· 136 下一页