2012年5月25日
USACO Section 1.3 Prime Cryptarithm （枚举）
摘要： Prime CryptarithmThe following cryptarithm is a multiplication problem that can be solved by substituting digits from a specified set of N digits into the positions marked with *. If the set of prime digits {2,3,5,7} is selected, the cryptarithm is called a PRIME CRYPTARITHM. * * * x * * ... 阅读全文
posted @ 2012-05-25 20:46 mtry 阅读(246) 评论(0) 推荐(0)