B. Cover Points time limit per test1 second memory limit per test256 megabytes inputstandard input outputstandard output There are n points on the plane, (x1,y1),(x2,y2),-,(xn,yn). You need to place an isosceles triangle with two sides on the coordin…

题目: There are nn points on the plane, (x1,y1),(x2,y2),…,(xn,yn)(x1,y1),(x2,y2),…,(xn,yn). You need to place an isosceles triangle with two sides on the coordinate axis to cover all points (a point is covered if it lies inside the triangle or on the s…

CF#511 div2 B 现场掉分赛(翻车)...qwq 题目大意: 给定n个点的左边,你需要求出一个腰长最短的等腰直角三角形(顶点为坐标轴原点),是的所有点都在这个等腰直角三角形的内部或者边上. 思路: 可转换为求函数 使该函数图像可以覆盖所有点的 b 值. 转换一下,使,所以就是求横纵坐标和的最大值. CODE: #include<iostream> #include<cstdio> #include<cmath> #include<algorithm>…

B. Cover Points time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output There are nn points on the plane, (x1,y1),(x2,y2),…,(xn,yn)(x1,y1),(x2,y2),…,(xn,yn). You need to place an isosceles triangle…

A - A  这题很巧妙啊,前两天刚好做过,而且就在博客里  Little C Loves 3 I time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Little C loves number «3» very much. He loves all things about it. Now he has a positive in…

Codeforces Round #511 (Div. 2) #include <bits/stdc++.h> using namespace std; int n; int main() { cin>>n; )%) cout<<<<endl; <<endl; } A. Little C Loves 3 I #include <bits/stdc++.h> using namespace std; int n; int main()…

只写了AB,甚至还WA了一次A题,暴露了蒟蒻的本质=.= 感觉考的时候有好多正确或和正解有关的思路,但是就想不出具体的解法或者想的不够深(长)(怕不是过于鶸) 话说CF的E题怎么都这么清奇=.= A.Little C Loves 3 I 随便拆一下就好了,大概全场就我一个心太急写挂了一次TAT #include<cstdio> #include<cstring> #include<algorithm> using namespace std; int main () {…

屌丝手动版 One of the things we’re sorely missing from Unity is nested prefabs. So we rolled this little script to help us out – and figured other people could benefit as well. You just add this script to a gameobject, and point the prefab field at the pr…

这场比赛我及时的参加了,但是打的时候状态实在是太烂了,只做出来了Div2的AB题. A Little C loves 3 I 直接构造就行. B Cover Points 应该很容易就看出来这个等腰三角形的腰是坐标轴,然后就用\(y=b-x\)的一次函数往上套就行了. C Enlarge GCD 这个题比赛的时候我交了4次,没有一次想到要先除gcd的.实际上在赛场上我已经接近正解了,就是枚举素因子,然后把最多的那个留着,其他的删掉就好了啊. 好吧,说起来简单,真正要把代码写到AC还是要看std的…

http://poj.org/problem?id=1266 Cover an Arc. Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 823   Accepted: 308 Description A huge dancing-hall was constructed for the Ural State University's 80-th anniversary celebration. The size of t…