jjs98

题目描述 Description给定平面上两个圆，第i个圆的圆心为（xi，yi），半径为ri。求两个圆公共部分的面积输入描述 Input Description给出6个实数 x1,y1,r1,x2,y2,r2     其中 r1,r2>0输出描述 Output Description输出公共部分面积，结果保留3位小数。

DescriptionCalculate the number of toys that land in each bin of a partitioned toy box. Mom and dad have a problem - their child John never puts his toys away when he is finished playing with them

主要思想先将所给点以x坐标从小到大（若x相等，以y从小到大）排序，从第一个点开始从左到右扫一遍，用叉积维护下凸壳（上凸壳亦可），在从右到左扫一遍，维护上（下）凸壳即可。代码如下：#include#include#include#include#include#includeusing namespace std;int n,zz;struct dian{int x

Problem DescriptionA segment and all segments which are connected with it compose a segment set. The size of a segment set is the number of segments in it. The problem is to find the size of some se

DescriptionInput第一行为N(0 Output从小到大输出可见直线的编号，两两中间用空格隔开,最后一个数字后面也必须有个空格Sample Input3-1 01 00 0Sample Output1 2

DescriptionBessie, Farmer John's prize cow, has just won first place in a bovine beauty contest, earning the title 'Miss Cow World'. As a result, Bessie will make a tour of N (2 <= N <= 50,000) fa

Description在某块平面土地上有N个点，你可以选择其中的任意四个点，将这片土地围起来，当然，你希望这四个点围成的多边形面积最大。Input第1行一个正整数N，接下来N行，每行2个数x,y，表示该点的横坐标和纵坐标。Output最大的多边形面积，答案精确到小数点后3位。Sample Input50 01 01 10 1

Description在一只大灰狼偷偷潜入Farmer Don的牛群被群牛发现后，贝西现在不得不履行着她站岗的职责。从她的守卫塔向下瞭望简直就是一件烦透了的事情。她决定做一些开发智力的小练习，防止她睡着了。想象牧场是一个X，Y平面的网格。她将N只奶牛标记为1…N (1 <= N <= 100,000)，每只奶牛的坐标为X_i,Y_i (-100,000 <= X_i <= 100,000;