原创 1013 Battle Over Cities (25 分)
1013 Battle Over Cities (25 分) It is vitally important to have all the cities connected by highways in a war. If a
原创 週記(5.19~5.24)
文章目錄I 本週記錄學會了幾個新詞一些文章一些話目標和感悟期許課外II 本週情況III 下週計劃 I 本週記錄 學會了幾個新詞 words meaning garbage in, garbage out 無用輸
原创 1009 Product of Polynomials (25 分)
1009 Product of Polynomials (25 分) This time, you are supposed to find A×B where A and B are two polynomials. Input
原创 1138 Postorder Traversal (25 分)
填坑 #include<iostream> #include <bits/stdc++.h> using namespace std; const int maxn = 50000 + 10; int n; int pr
原创 週記(5.26~5.31)//待更新
文章目錄I 本週記錄新詞學習一些話一些收藏心情/感想II 本週學習情況計劃完成情況本週情況III 下週計劃少即是多 I 本週記錄 新詞學習 words means from 疑黑無據 懷疑你在黑我,但是我沒有證據
原创 週記6.2-6.7
preface 這麼快就週五了QAQ 一句話 學如逆水行舟,不進則退; 心似平原走馬,易放難收。 Peer Pressure 心情 焦慮 + 嘗試改變
原创 1052 Linked List Sorting (25 分)
1052 Linked List Sorting (25 分) A linked list consists of a series of structures, which are not necessarily adjacen
原创 1142 Maximal Clique (25 分)
1142 Maximal Clique (25 分) A clique is a subset of vertices of an undirected graph such that every two distinct ver
原创 1140 Look-and-say Sequence (20 分)
1140 Look-and-say Sequence (20 分) Look-and-say sequence is a sequence of integers as the following: D, D1, D111, D1
原创 1097 Deduplication on a Linked List (25 分)
1097 Deduplication on a Linked List (25 分) Given a singly linked list L with integer keys, you are supposed to remo
原创 解決Cortana顯示空白的情況
Cortana突然不能用了? 搜索什麼都是顯示空白。 在桌面按住shift鍵,再右擊,點擊“在此處打開powershell窗口”,輸入下列代碼: Get-AppXPackage -Name Microsoft.Windows.Co
原创 1154 Vertex Coloring (25 分)
1154 Vertex Coloring (25 分) A proper vertex coloring is a labeling of the graph’s vertices with colors such that no
原创 1147 Heaps (30 分)
1147 Heaps (30 分) In computer science, a heap is a specialized tree-based data structure that satisfies the heap pr
原创 1118 Birds in Forest (25 分)
1118 Birds in Forest (25 分) Some scientists took pictures of thousands of birds in a forest. Assume that all the bi
原创 1155 Heap Paths (30 分)
1155 Heap Paths (30 分) In computer science, a heap is a specialized tree-based data structure that satisfies the he