01 2013 档案
trie
摘要:Trie(retrieval) is an order tree data structure that is used to store “string”.Unlike normal tree, trie does not store data in its nodes,node position indicates what data the node associates with.below is what a trie looks like holding string: ab, ac,b,cd,cde,d.A simple definition of a trie node:str 阅读全文
posted @ 2013-01-28 17:06 twoon 阅读(384) 评论(0) 推荐(0) 编辑
wxLog 的使用
摘要:(一)输出 log 是调试及监控程序运行状态的一种关键手段,写 GUI 程序也不例外,具体对 wxWidgets 来说,它提供了如下一系列内置函数来处理 log 的输出:wxLogErrorwxLogWarningwxLogMessagewxLogDebugwxLogVerbose 从它们的名字我们... 阅读全文
posted @ 2013-01-28 11:36 twoon 阅读(2782) 评论(0) 推荐(0) 编辑
basic introduction to log4cplus
摘要:Log4cplus has three main components:LayoutsAppendersLoggers These three type of components found the basic of the log4cplus framework. here is a simplified uml graph illustrating the relationships of those classes: (1) A "Layout" class determines the format of the log message(how do w... 阅读全文
posted @ 2013-01-28 09:31 twoon 阅读(605) 评论(0) 推荐(0) 编辑
前言
摘要:一直在琢磨着要写写技术博客,不求很用心,但起码能对自己工作或日常学习中碰到的各种问题及技能,平常的一些思考做做记录和总结,雁过也留痕,知识就是这样慢慢积累和传承的。曾经也零零散散地在百度和腾讯空间上写过几篇,现在想来太惭愧,好歹是技术人员,码了几年的代码,那文章的质量,那写作的态度太不堪入目了。毕... 阅读全文
posted @ 2013-01-26 23:25 twoon 阅读(271) 评论(1) 推荐(0) 编辑
anti prime
摘要:sicily 1002. Anti-prime SequencesConstraintsTime Limit: 3 secs, Memory Limit: 32 MBDescriptionGiven a sequence of consecutive integers n,n+1,n+2,...,m... 阅读全文
posted @ 2013-01-26 22:36 twoon 阅读(360) 评论(0) 推荐(0) 编辑
Fibonacci sequence
摘要:1133. Fibonacci SequenceTime Limit: 1.0 secondMemory Limit: 16 MBis an infinite sequence of integers that satisfies to Fibonacci conditionFi+2=Fi+1+Fi... 阅读全文
posted @ 2013-01-26 21:51 twoon 阅读(517) 评论(0) 推荐(0) 编辑