蒟蒻第二个点TLEqwq,求助dalao
查看原帖
蒟蒻第二个点TLEqwq,求助dalao
547513
daonan楼主2022/1/29 23:15
#include<bits/stdc++.h>
using namespace std;
struct node
{
    int x=0;
	int y=0;
}ex[10005];

int main(){
    int n=0;
    double num = 1919810;
    cin>>n;
    for(int i = 1;i <= n;i++)
	{
        scanf("%d%d",&ex[i].x,&ex[i].y);
    }
    for(int i = 1;i <= n;i++)
	{
        for(int j = i+1;j <= n;j++)
		{
            if(i != j){
                int x = ex[i].x - ex[j].x;
                int y = ex[i].y - ex[j].y;
                double z = sqrt(pow(x,2) + pow(y,2));
                num = min(num,z);
            }
        }
    }
    printf("%.4f",num);
}
2022/1/29 23:15
加载中...