Description   Given an integer N, your task is to judge whether there exist N points in the plane such that satisfy the following conditions: 1. The distance between any two points is no greater than 1.0. 2. The distance between any point and the ori…

Forever 0.5 Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u Submit Status Description Given an integer N, your task is to judge whether there exist N points in the plane such that satisfy the following conditions: 1. The…

Description Fat brother and Maze are playing a kind of special (hentai) game in the playground. (Maybe it’s the OOXX game which decrypted in the last problem, who knows.) But as they don’t like using repellent while playing this kind of special (hent…

 Problem 2140 Forever 0.5 Accept: 36    Submit: 113    Special JudgeTime Limit: 1000 mSec    Memory Limit : 32768 KB Problem Description Given an integer N, your task is to judge whether there exist N points in the plane such that satisfy the followi…

Problem 2140 Forever 0.5 Accept: 371 Submit: 1307 Special Judge Time Limit: 1000 mSec Memory Limit : 32768 KB Problem Description Given an integer N, your task is to judge whether there exist N points in the plane such that satisfy the following cond…

题目:http://acm.fzu.edu.cn/problem.php?pid=2140 题意: 题目大意:给出n,要求找出n个点,满足: 1)任意两点间的距离不超过1: 2)每个点与(0,0)点的距离不超过1: 3)有n对点之间的距离刚好为1: 4)n个点组成的多边形面积大于0.5: 5)n个点组成的多边形面积小于0.75: 思路:只要有4个点以上就是,构造时先找出四个点,再在半径为1的圆上找点就行. 很巧妙的一道题目呀.... #include <iostream> #include &…

主要就是将圆离散化,剩下的都好办 #include<iostream> #include<cstdio> #include<cstring> #include<cmath> using namespace std; #define add 0.005 ],y[]; int main() { int t,n; scanf("%d",&t); x[] = y[] = ; x[] = ,y[] = ; x[] = ] = sqrt(0.…

Description Three wizards are doing a experiment. To avoid from bothering, a special magic is set around them. The magic forms a circle, which covers those three wizards, in other words, all of them are inside or on the border of the circle. And due…

Description There are a lot of trees in an area. A peasant wants to buy a rope to surround all these trees. So at first he must know the minimal required length of the rope. However, he does not know how to calculate it. Can you help him?        The…

题目链接:http://acm.sgu.ru/problem.php?contest=0&problem=275 这是一道xor高斯消元. 题目大意是给了n个数,然后任取几个数,让他们xor和最大. 首先根据题目意思可以列出下列方程组: //a11x1+a21x2……=d[1] //a12x1+a22x2……=d[2] //... (每个数二进制按列来写,xi为0或1,表示取或不取这个数.) 结果的二进制即为d数组. 由于需要结果最大,而结果最多是d全为1,那么就假设所有d均为1,然后进行高斯消…