![](https://img-blog.csdnimg.cn/20190918140012416.png?x-oss-process=image/resize,m_fixed,h_224,w_224)
哈希
文章平均质量分 91
哈希
_sky123_
这个作者很懒,什么都没留下…
展开
-
Educational Codeforces Round 95 (Rated for Div. 2) G. Three Occurrences
题目链接You are given an array aaa consisting of nnn integers. We denote the subarray a[l..r]a[l..r]a[l..r] as the array [al,al+1,…,ar][a_l, a_{l + 1}, \dots, a_r][al,al+1,…,ar] (1≤l≤r≤n1 \le l \le r \le n1≤l≤r≤n).A subarray is considered good if every in原创 2021-02-13 18:00:04 · 190 阅读 · 2 评论 -
2020CCPC 威海 G Caesar Cipher
题目链接Have you ever heard of the Caesar cipher? It is one of the simplest and best-known encryption techniques. Named after Julius Caesar, he used this cipher to communicate with his generals.Caesar cipher is a type of substitution cipher in which each let原创 2020-12-17 19:47:58 · 280 阅读 · 0 评论 -
2020 Multi-University Training Contest 2 The Oculus
Problem DescriptionLet’s define the Fibonacci sequence F1,F2,…F_1,F_2,\dotsF1,F2,… as F1=1,F2=2,Fi=Fi−1+Fi−2(i≥3)F_1=1,F_2=2,F_i=F_{i−1}+F_{i−2} (i≥3)F1=1,F2=2,Fi=Fi−1+Fi−2(i≥3).It’s well known that every positive integer xxx has its unique Fibona原创 2020-08-28 17:01:43 · 149 阅读 · 0 评论