Silence的博客

Fake News 传送门题目大意给定一个数字 n，问是否存在 x 满足 x 2 = ∑k=1n\sum_{k=1}^n∑k=1n​ K2输入描述There are multiple test cases. The first line of the input contains an integer T (1 ≤ T ≤ 1e6) indicating the number of test cases.For each test case, the first line contain.

Easy Construction 传送门链接：https://ac.nowcoder.com/acm/contest/5671/E来源：牛客网E. Easy ConstructionProblem DescriptionRoundgod is given n,k, construct a permutation P of 1∼n satisfying that for all integers i in [1,n] , there exists a contiguous subarray .

点我跳转原题解题思路四种类型的情况如下type 0: There are no fish and no clam in this stage.type 1: There are no fish and one clam in this stage.type 2: There are one fish and no clam in this stage.type 3: There are one fish and one clam in this stage.题目大意是要我们最优选择然后.

Finding the Order点我去看原题解题思路这道题需要找到特殊情况即：可以通过判断△ACD是否属于等腰三角形，从而通过判断各边的长度得到C，D的方位是在左边还是右边Input23 5 5 35 3 3 5OutputAB//CDAB//DCAC代码#include<iostream>#include<algorithm>using namespace std;int main(){ ios::sync_with_stdio(f