2013年6月3日
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 阅读(455) 评论(0) 推荐(0)