摘要: Joke with permutation Time Limit: 3000ms, Special Time Limit:7500ms, Memory Limit:65536KB Total submit users: 87, Accepted users: 60 Problem 1... 阅读全文
posted @ 2015-08-03 14:09 __NaCl 阅读(148) 评论(0) 推荐(0) 编辑
摘要: 题目链接http://acm.hnu.cn/online/?action=problem&type=show&id=13342&courseid=0 Problem description The races became more popular than ever... 阅读全文
posted @ 2015-08-03 13:36 __NaCl 阅读(133) 评论(0) 推荐(0) 编辑
摘要: 题目链接http://acm.hnu.cn/online/?action=problem&type=show&id=13342&courseid=0 Problem description The races became more popular than ever at Pand... 阅读全文
posted @ 2015-08-03 13:35 __NaCl 阅读(159) 评论(0) 推荐(0) 编辑
摘要: DescriptionMany people like to solve hard puzzles some of which may lead them to madness. One such puzzle could be finding a hidden pr... 阅读全文
posted @ 2015-07-25 10:15 __NaCl 阅读(116) 评论(0) 推荐(0) 编辑
摘要: DescriptionMany people like to solve hard puzzles some of which may lead them to madness. One such puzzle could be finding a hidden prime numb... 阅读全文
posted @ 2015-07-25 10:15 __NaCl 阅读(132) 评论(0) 推荐(0) 编辑
摘要: Problem DescriptionThere are n apple trees planted along a cyclic road, which is L metres long. Your storehouse is built at position 0... 阅读全文
posted @ 2015-07-24 17:03 __NaCl 阅读(164) 评论(0) 推荐(0) 编辑
摘要: Problem DescriptionThere are n apple trees planted along a cyclic road, which is L metres long. Your storehouse is built at position 0 on that... 阅读全文
posted @ 2015-07-24 17:02 __NaCl 阅读(102) 评论(0) 推荐(0) 编辑
摘要: Your current task is to make a ground plan for a residential building located in HZXJHS. So you must determine a way to split the fl... 阅读全文
posted @ 2015-07-23 22:09 __NaCl 阅读(116) 评论(0) 推荐(0) 编辑
摘要: Your current task is to make a ground plan for a residential building located in HZXJHS. So you must determine a way to split the floor buil... 阅读全文
posted @ 2015-07-23 22:09 __NaCl 阅读(142) 评论(0) 推荐(0) 编辑
摘要: #include#include#include#include#include#include#define max 500using namespace std;typedef struct node{ char data; struct node *l... 阅读全文
posted @ 2015-07-20 22:34 __NaCl 阅读(102) 评论(0) 推荐(0) 编辑