FZU 2140

思维：

点都在这个正三角形的弧上，当初一直是这个convex hull 搞死了，不知道是凸包以为是每个三角形的面积，，，，，，，，

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
using namespace std;
const int maxn = 100 + 10;
#define INF 0x3f3f3f3f
int n;
struct Node
{
    Node(){}
    Node(double _x,double _y):x(_x),y(_y){}
    double x,y;
}a[maxn];
double distances(Node x,Node y)
{
    return sqrt((x.x - y.x) * (x.x - y.x) + (x.y - y.y) * (x.y - y.y));
}
double calc(double t)
{
    return sqrt(1.0 - t * t);
}
int main()
{
    int Tcase;
    scanf("%d",&Tcase);
    while(Tcase --)
    {
        int n;
        scanf("%d",&n);
        if(n <= 3)
        {
            puts("No");
            continue;
        }
        else puts("Yes");
        a[0] = Node(0,0);a[1] = Node(1.0,0);a[2] = Node(0.5,sqrt(3.0)/2.0);a[3] = Node(sqrt(3.0)/2.0,0.5);
        for(int i = 0; i < 4; i ++)
            printf("%.6f %.6f\n",a[i].x,a[i].y);
        for(int i = 1; i <= n - 4;i ++)
            printf("%.6f %.6f\n",a[3].x,a[3].y);
    }
    return 0;
}