摘要：
Codeforces Round #560 (Div. 3) E. Two Arrays and Sum of Functions Description You are given two arrays aa and bb, both of length nn. Let's define a fu 阅读全文
摘要：
题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=2668 Daydream Problem Description Welcome to 2009 HDU Girl’s Cup, bless you will happy in it. Every gir 阅读全文
摘要：
https://loj.ac/problems/search?keyword=%E5%88%86%E5%9D%97 https://blog.csdn.net/keepcoral/article/details/80743559 数列分块入门 1 正确解法： 简单分块，然后区间之外的暴力，区间之内的 阅读全文
摘要：
正确解法： 分块（超时） 1 #include <iostream> 2 #include <cstdio> 3 #include <cstring> 4 #include <cmath> 5 #include <algorithm> 6 #include <set> 7 #include <map 阅读全文
摘要：
主要解法 肯定要提前预留出di 数组，然后就是线段树。 刚开始以为 因子数=i-phi[i]+1 后来发现并不是，4和6不是因子关系，但是他们不是互质的，这两个的含义不一样， 并不是互补的 我们发现数据范围为1e6，然后一步步迭代 最终都会变成 1或者 2 d[1]=1 d[2]=2; 最多可迭代6 阅读全文
摘要：
欧拉函数：在数论，对正整数n，欧拉函数是小于或等于n的数中与n互质的数的数目。 阅读全文
摘要：
1 #include<iostream> 2 #include<cstdio> 3 #include<string> 4 #include<cstring> 5 #include<map> 6 #include<set> 7 #include<vector> 8 #include<queue> 9 阅读全文
摘要：
E. Two Teams Description There are 𝑛n students standing in a row. Two coaches are forming two teams — the first coach chooses the first team and the 阅读全文
摘要：
C. Serval and Parenthesis Sequence Description Serval soon said goodbye to Japari kindergarten, and began his life in Japari Primary School. In his fa 阅读全文
摘要：
Thanks, TuSimple! Description As a manager of TuSimple, you are going to hold a dancing party for both the Development Department and the Marketing De 阅读全文