原创 acm學期總結
經過了這一個學期的acm課程的學習，我收穫了很多的東西，並不僅僅是做題的水平提高了，還有很多其他的能力也跟着提高了。下面我就對我這一個學期以來acm的學習做一下總結。 先說說我通過acm的學習收穫了什麼。首先是我的英語水平
2020-06-16 02:52:45
原创 Educational Codeforces Round 89 C. Palindromic Paths
題目描述 You are given a matrix with n rows (numbered from 1 to n) and m columns (numbered from 1 to m). A number ai,j
2020-06-16 02:52:44
原创 #646 (Div. 2)C. Game On Leaves（博弈論）
題目描述 Ayush and Ashish play a game on an unrooted tree consisting of n nodes numbered 1 to n. Players make the foll
2020-06-16 02:52:44
原创 #644 (Div. 3)F. Spy-string（暴力枚舉）
題目描述 You are given n strings a1,a2,…,an: all of them have the same length m. The strings consist of lowercase Engl
2020-06-16 02:52:44
原创 Educational Codeforces Round 89 B. Shuffle
題目描述 You are given an array consisting of n integers a1, a2, …, an. Initially ax=1, all other elements are equal t
2020-06-16 02:52:44
原创 #648 (Div. 2)C. Rotation Matching
題目描述 After the mysterious disappearance of Ashish, his two favourite disciples Ishika and Hriday, were each left w
2020-06-16 02:52:44
原创 #644 (Div. 3)E. Polygon(思維)
題目描述 Polygon is not only the best platform for developing problems but also a square matrix with side n, initially
2020-05-26 22:54:14
原创 #642 (Div. 3)C. Board Moves（遞推）
題目描述 You are given a board of size n×n, where n is odd (not divisible by 2). Initially, each cell of the board con
2020-05-21 07:56:38
原创 5.17訓練日記
這周我們學習了數論的內容，說實話，學起來是挺吃力的。關於數論的題目，代碼都比較短，但是與動態規劃不同的是：數論的內容計算量比較大，（而且也很難想）再加上我的數學基礎不好。所以，做訓練題就比較吃力。不過原因除了這個外，還有有一些其他
2020-05-21 07:56:38
原创 #642 (Div. 3)D. Constructing the Array（優先隊列）
題目描述 You are given an array a of length n consisting of zeros. You perform n actions with this array: during the i
2020-05-21 07:56:38
原创 #641 (Div. 2)D. Orac and Medians
題目描述 Slime has a sequence of positive integers a1,a2,…,an. In one operation Orac can choose an arbitrary subsegmen
2020-05-15 05:50:05
原创 #641 (Div. 2)A. Orac and Factors
題目描述 Orac is studying number theory, and he is interested in the properties of divisors. For two positive integers
2020-05-15 05:50:05
原创 #641 (Div. 2)B. Orac and Models（dfs）
題目描述 There are n models in the shop numbered from 1 to n, with sizes s1,s2,…,sn. Orac will buy some of the models
2020-05-15 05:50:05
原创 #641 (Div. 2)C. Orac and LCM
題目描述 For the multiset of positive integers s={s1,s2,…,sk}, define the Greatest Common Divisor (GCD) and Least Comm
2020-05-15 05:50:05
原创 STL容器用法總結
vector 向量 可以說就是一個動態的數組，可以動態的增減容器中的元素數量。 需要頭文件#include <vector> 定義方式：vector<數據類型> 變量名稱; size() //返回元素個數,時間複雜度O(1) em
2020-05-12 18:59:55