摘要: 题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1711 Number Sequence Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)T 阅读全文
posted @ 2019-11-09 00:28 Maynerd 阅读(126) 评论(0) 推荐(0) 编辑
摘要: 题目链接:http://poj.org/problem?id=3450 Corporate Identity Beside other services, ACM helps companies to clearly state their “corporate identity”, which i 阅读全文
posted @ 2019-11-07 08:32 Maynerd 阅读(167) 评论(0) 推荐(0) 编辑
摘要: 题目链接:http://poj.org/problem?id=3080 Blue Jeans The Genographic Project is a research partnership between IBM and The National Geographic Society that 阅读全文
posted @ 2019-11-06 22:06 Maynerd 阅读(201) 评论(0) 推荐(0) 编辑
摘要: 题目链接:http://poj.org/problem?id=3461 Oulipo The French author Georges Perec (1936–1982) once wrote a book, La disparition, without the letter 'e'. He w 阅读全文
posted @ 2019-11-05 09:42 Maynerd 阅读(185) 评论(0) 推荐(0) 编辑
摘要: 题目链接:http://poj.org/problem?id=2752 Seek the Name, Seek the Fame The little cat is so famous, that many couples tramp over hill and dale to Byteland, 阅读全文
posted @ 2019-11-04 18:16 Maynerd 阅读(125) 评论(0) 推荐(0) 编辑
摘要: 题目链接:http://poj.org/problem?id=2406 Power Strings Given two strings a and b we define a*b to be their concatenation. For example, if a = "abc" and b = 阅读全文
posted @ 2019-11-04 00:21 Maynerd 阅读(313) 评论(0) 推荐(0) 编辑
摘要: 题目链接:http://poj.org/problem?id=3579 Given N numbers, X1, X2, ... , XN, let us calculate the difference of every pair of numbers: ∣Xi - Xj∣ (1 ≤ i < j  阅读全文
posted @ 2019-10-20 20:03 Maynerd 阅读(279) 评论(0) 推荐(0) 编辑
摘要: 题目链接:http://poj.org/problem?id=1704 Georgia and Bob Georgia and Bob decide to play a self-invented game. They draw a row of grids on paper, number the 阅读全文
posted @ 2019-10-19 15:29 Maynerd 阅读(190) 评论(0) 推荐(0) 编辑
摘要: 题目链接:http://codeforces.com/problemset/problem/1077/C Let's call an array good if there is an element in the array that equals to the sum of all other 阅读全文
posted @ 2019-07-30 11:22 Maynerd 阅读(465) 评论(0) 推荐(0) 编辑
摘要: 题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1024 Problem Description Now I think you have got an AC in Ignatius.L's "Max Sum" problem. To be a brav 阅读全文
posted @ 2019-03-26 23:25 Maynerd 阅读(494) 评论(0) 推荐(1) 编辑