_Zlrrr - 博客园

2018年10月29日

摘要： 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 _Zlrrr 阅读(240) 评论(0) 推荐(0)

HDU 2212 DFS

摘要： 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 _Zlrrr 阅读(203) 评论(0) 推荐(0)

2018年10月26日

CodeForces D. Walking Between Houses

摘要： 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 _Zlrrr 阅读(352) 评论(0) 推荐(0)

2018年10月25日

二叉搜索树增加，查找，删除

摘要： #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 _Zlrrr 阅读(261) 评论(0) 推荐(0)

PAT 甲级 1058 A+B in Hogwarts

摘要： 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 _Zlrrr 阅读(201) 评论(0) 推荐(0)

PAT 甲级 1052 Linked List Sorting

摘要： 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 _Zlrrr 阅读(143) 评论(0) 推荐(0)

2018年10月24日

CodeForces C. Songs Compression

摘要： 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 _Zlrrr 阅读(364) 评论(0) 推荐(0)

CodeForces B. Obtaining the String

摘要： 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 _Zlrrr 阅读(431) 评论(0) 推荐(0)

CodeForces A. Points in Segments

摘要： 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 _Zlrrr 阅读(247) 评论(0) 推荐(0)

PAT 甲级 1031 Hello World for U

摘要： https://pintia.cn/problem-sets/994805342720868352/problems/994805462535356416 Given any string of N (≥) characters, you are asked to form the characte 阅读全文

posted @ 2018-10-24 20:01 _Zlrrr 阅读(138) 评论(0) 推荐(0)

丧心病狂工科女

公告