2020年8月2日
1022 Digital Library (30分)
摘要： A Digital Library contains millions of books, stored according to their titles, authors, key words of their abstracts, publishers, and published years 阅读全文
posted @ 2020-08-02 22:10 yys_c 阅读(133) 评论(0) 推荐(0)
递归指数型枚举
摘要： 输入n，输出「1～n」的幂集。 位运算 #include<iostream> using namespace std; int n; void dfs(int u, int k){ if(u == n){ for(int i = 0; i < u; i ++) if(k >> i & 1) cout 阅读全文
posted @ 2020-08-02 13:54 yys_c 阅读(122) 评论(0) 推荐(0)
1021 Deepest Root (25分)
摘要： A graph which is connected and acyclic can be considered a tree. The height of the tree depends on the selected root. Now you are supposed to find the 阅读全文
posted @ 2020-08-02 09:53 yys_c 阅读(130) 评论(0) 推荐(0)