上一页 1 ··· 49 50 51 52 53 54 55 56 57 ··· 87 下一页
摘要: http://acm.hdu.edu.cn/showproblem.php?pid=2217 Problem Description Wangye is interested in traveling. One day, he want to make a visit to somedifferen 阅读全文
posted @ 2018-10-29 20:42 丧心病狂工科女 阅读(201) 评论(0) 推荐(0) 编辑
摘要: http://acm.hdu.edu.cn/showproblem.php?pid=2224 Problem Description There are n points on the plane, Pi(xi, yi)(1 <= i <= n), and xi < xj (i<j). You be 阅读全文
posted @ 2018-10-29 20:40 丧心病狂工科女 阅读(234) 评论(0) 推荐(0) 编辑
摘要: http://acm.hdu.edu.cn/showproblem.php?pid=2212 Problem Description A DFS(digital factorial sum) number is found by summing the factorial of every digi 阅读全文
posted @ 2018-10-29 20:38 丧心病狂工科女 阅读(193) 评论(0) 推荐(0) 编辑
摘要: http://codeforces.com/contest/1015/problem/D There are nn houses in a row. They are numbered from 11 to nn in order from left to right. Initially you 阅读全文
posted @ 2018-10-26 20:08 丧心病狂工科女 阅读(337) 评论(0) 推荐(0) 编辑
摘要: #include using namespace std; struct Node { int key; Node *right, *left, *parent; }; Node *root, *NIL; void insert(int k) { Node *y = NIL; Node *x = root; Node *z; z = (N... 阅读全文
posted @ 2018-10-25 21:08 丧心病狂工科女 阅读(253) 评论(0) 推荐(0) 编辑
摘要: https://pintia.cn/problem-sets/994805342720868352/problems/994805416519647232 If you are a fan of Harry Potter, you would know the world of magic has 阅读全文
posted @ 2018-10-25 21:07 丧心病狂工科女 阅读(187) 评论(0) 推荐(0) 编辑
摘要: https://pintia.cn/problem-sets/994805342720868352/problems/994805425780670464 A linked list consists of a series of structures, which are not necessar 阅读全文
posted @ 2018-10-25 21:05 丧心病狂工科女 阅读(134) 评论(0) 推荐(0) 编辑
摘要: http://codeforces.com/contest/1015/problem/C Ivan has nn songs on his phone. The size of the ii-th song is aiai bytes. Ivan also has a flash drive whi 阅读全文
posted @ 2018-10-24 20:08 丧心病狂工科女 阅读(339) 评论(0) 推荐(0) 编辑
摘要: http://codeforces.com/contest/1015/problem/B You are given two strings ss and tt. Both strings have length nn and consist of lowercase Latin letters. 阅读全文
posted @ 2018-10-24 20:07 丧心病狂工科女 阅读(418) 评论(0) 推荐(0) 编辑
摘要: http://codeforces.com/contest/1015/problem/A You are given a set of nn segments on the axis OxOx, each segment has integer endpoints between 11 and mm 阅读全文
posted @ 2018-10-24 20:04 丧心病狂工科女 阅读(231) 评论(0) 推荐(0) 编辑
上一页 1 ··· 49 50 51 52 53 54 55 56 57 ··· 87 下一页