#忘乎所以#

2019年8月10日

摘要： 1117 Eddington Number (25 分) 1117 Eddington Number (25 分) 1117 Eddington Number (25 分) British astronomer Eddington liked to ride a bike. It is said t 阅读全文

posted @ 2019-08-10 00:29 #忘乎所以# 阅读(273) 评论(0) 推荐(0)

1116 Come on! Let's C (20 分)

摘要： 1116 Come on! Let's C (20 分) 1116 Come on! Let's C (20 分) 1116 Come on! Let's C (20 分) "Let's C" is a popular and fun programming contest hosted by th 阅读全文

posted @ 2019-08-10 00:15 #忘乎所以# 阅读(289) 评论(0) 推荐(0)

2019年8月9日

1135 Is It A Red-Black Tree (30 分)

摘要： 1135 Is It A Red-Black Tree (30 分) 1135 Is It A Red-Black Tree (30 分) 1135 Is It A Red-Black Tree (30 分) There is a kind of balanced binary search tre 阅读全文

posted @ 2019-08-09 23:48 #忘乎所以# 阅读(487) 评论(0) 推荐(0)

1066 Root of AVL Tree (25 分)

摘要： 1066 Root of AVL Tree (25 分) 1066 Root of AVL Tree (25 分) 1066 Root of AVL Tree (25 分) An AVL tree is a self-balancing binary search tree. In an AVL t 阅读全文

posted @ 2019-08-09 21:30 #忘乎所以# 阅读(241) 评论(0) 推荐(0)

1123 Is It a Complete AVL Tree (30 分)

摘要： 1123 Is It a Complete AVL Tree (30 分) 1123 Is It a Complete AVL Tree (30 分) 1123 Is It a Complete AVL Tree (30 分) An AVL tree is a self-balancing bina 阅读全文

posted @ 2019-08-09 21:26 #忘乎所以# 阅读(204) 评论(0) 推荐(0)

1122 Hamiltonian Cycle (25 分)

摘要： 1122 Hamiltonian Cycle (25 分) 1122 Hamiltonian Cycle (25 分) 1122 Hamiltonian Cycle (25 分) The "Hamilton cycle problem" is to find a simple cycle that 阅读全文

posted @ 2019-08-09 12:34 #忘乎所以# 阅读(402) 评论(0) 推荐(0)

1121 Damn Single (25 分)

摘要： 1121 Damn Single (25 分) 1121 Damn Single (25 分) 1121 Damn Single (25 分) "Damn Single (单身狗)" is the Chinese nickname for someone who is being single. Y 阅读全文

posted @ 2019-08-09 12:05 #忘乎所以# 阅读(250) 评论(0) 推荐(0)

1120 Friend Numbers (20 分)

摘要： 1120 Friend Numbers (20 分) 1120 Friend Numbers (20 分) 1120 Friend Numbers (20 分) Two integers are called "friend numbers" if they share the same sum o 阅读全文

posted @ 2019-08-09 11:48 #忘乎所以# 阅读(174) 评论(0) 推荐(0)

2019年8月8日

1127 ZigZagging on a Tree (30 分)

摘要： 1127 ZigZagging on a Tree (30 分) 1127 ZigZagging on a Tree (30 分) 1127 ZigZagging on a Tree (30 分) Suppose that all the keys in a binary tree are dist 阅读全文

posted @ 2019-08-08 23:42 #忘乎所以# 阅读(496) 评论(0) 推荐(0)

1126 Eulerian Path (25 分)

摘要： 1126 Eulerian Path (25 分) 1126 Eulerian Path (25 分) 1126 Eulerian Path (25 分) In graph theory, an Eulerian path is a path in a graph which visits ever 阅读全文

posted @ 2019-08-08 22:10 #忘乎所以# 阅读(154) 评论(0) 推荐(0)

当你的能力还配不上你的目标时，没有资格后退！

公告