随笔分类 -  ACM — 二叉树

poj 1426 Find The Multiple(搜索BFS的思想+ 同余模定理+二叉树+01哈夫曼编码)
摘要：http://poj.org/problem?id=1426Find The MultipleTime Limit:1000MSMemory Limit:10000KTotal Submissions:14519Accepted:5893Special JudgeDescriptionGiven a positive integer n, write a program to find out a nonzero multiple m of n whose decimal representation contains only the digits 0 and 1. You may assu 阅读全文
posted @ 2013-06-03 22:13 crazy_apple 阅读(456) 评论(0) 推荐(0)
hdu 3791 二叉搜索树
摘要：http://acm.hdu.edu.cn/showproblem.php?pid=3791二叉搜索树Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1905Accepted Submission(s): 850Problem Description判断两序列是否为同一二叉搜索树序列Input开始一个数n，(1<=n<=20) 表示有n个需要判断，n= 0 的时候输入结束。接下去一行是一个序列，序列长度小于10，包含(0~9)的数字 阅读全文
posted @ 2013-05-14 10:47 crazy_apple 阅读(351) 评论(0) 推荐(0)