11 2015 档案

POJ3278 Catch That Cow(BFS)
摘要：DescriptionFarmer John has been informed of the location of a fugitive cow and wants to catch her immediately. He starts at a point N (0 ≤ N ≤ 100,000... 阅读全文
posted @ 2015-11-09 09:24 JoneZP 阅读(134) 评论(0) 推荐(0)
类的设计
摘要：1001: 类的设计（1）Time Limit: 1 SecMemory Limit: 65535 MB 64bit IO Format: %lldSubmitted: 9Accepted: 7[Submit][Status][Web Board]Description设计clock类，成员数据包含... 阅读全文
posted @ 2015-11-08 22:58 JoneZP 阅读(525) 评论(0) 推荐(0)
HOJ 1096 Divided Product (DFS）
摘要：时间限制:10000ms单点时限:1000ms内存限制:256MB描述Given two positive integers N and M, please divide N into several integers A1, A2, ..., Ak (k >= 1), so that:1. 0 1... 阅读全文
posted @ 2015-11-04 21:58 JoneZP 阅读(144) 评论(0) 推荐(0)