Rotepad的博客

题目：Little Petya has a birthday soon. Due this wonderful event, Petya's friends decided to give him sweets. The total number of Petya's friends equals ton.Let us remind you the definition of the g...

题目：Yousef loves playing with functions in his free time. Today, he invents the following function:Yousef will give you a list of queries, and you need to find the answers for them. For each quer...

题目：Gym - 101466C题意：给定一个标准点坐标跟其他n-1个点的坐标，问从标准点最少射多少条线能把所有点都通过一遍题解：用向量，找三个数的gcd：，然后除以gcd得到类似一个单位向量的，然后再hash判断当前的hash对应有多少个，本来想用set的，结果不会搞，后来发现map，vector可以直接判重：vector<pair<pair<double,do...

题目：CodeForces - 851C题意：一个5维坐标图中能够找到点a，点a满足与任意两个点b，c所成直线的夹角不为锐角题解：直接暴力枚举点，然后用arccos公式求得两直线所成夹角度数，具体方法可以去传送门看一下代码：//Ö±½Ó±©Á¦£¬×¢Ò⻡¶Èת½Ç¶È #include<bits/stdc++.h>#define N 1005//#def...

题目：BZOJ - 5028题解：扩展裴蜀定理+差分+线段树求从l到r的最小能得到的油量就是求l~r范围内a[i]的gcd由性质gcd(a,b)=gcd(a,b-a)可得区间gcd可变为:gcd( a[l], a[l+1], a[l+2],..., a[r] ) = gcd( a[l], a[l+1] - a[l] , a[l+2] - a[l+1] ,..., a[r] - ...