FZU 2140 Forever 0.5

    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 origin (0,0) is no greater than 1.0.

    3. There are exactly N pairs of the points that their distance is exactly 1.0.

    4. The area of the convex hull constituted by these N points is no less than 0.5.

    5. The area of the convex hull constituted by these N points is no greater than 0.75.
Input

    The first line of the date is an integer T, which is the number of the text cases.

    Then T cases follow, each contains an integer N described above.

    1 <= T <= 100, 1 <= N <= 100
Output

    For each case, output “Yes” if this kind of set of points exists, then output N lines described these N points with its coordinate. Make true that each coordinate of your output should be a real number with AT MOST 6 digits after decimal point.

    Your answer will be accepted if your absolute error for each number is no more than 10-4.

    Otherwise just output “No”.

    See the sample input and output for more details.
Sample Input

    3
    2
    3
    5

Sample Output

    No
    No
    Yes
    0.000000 0.525731
    -0.500000 0.162460
    -0.309017 -0.425325
    0.309017 -0.425325
    0.500000 0.162460

Hint

    This problem is special judge.

题目forever 0.5！！！forever 0.5！！！forever 0.5！！！!

#include<iostream>
#include<cstdio>
#include<cmath>
using namespace std;
int T,n;
double x[4]={0,-0.5,0.5,0};
double y[4]={0.866025,0,0,-0.133975};
const double eps=0.001;//key
int main()
{
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d",&n);
        if(n<4)
        {
            printf("No\n");
            continue;
        }
        printf("Yes\n");
        for(int i=0;i<4;i++)
        {
            printf("%.6lf %.6lf\n",x[i],y[i]);
        }
        n-=4;
        double xx=x[0],yy;
        while(n--)
        {
            xx+=eps;
            yy=sqrt(1-(xx-x[1])*(xx-x[1]));
            printf("%.6lf %.6lf\n",xx,yy);
        }
    }
    return 0;
}

learn from