Submission #2868877
Source Code Expand
#include <cmath> #include <cstdio> #include <cstdlib> #include <algorithm> using namespace std; const int N=100+1; double maxn=0; int n; struct node { int x; int y; }point[N]; double dis(int x1,int y1,int x2,int y2) { int xx=abs(x1-x2); int yy=abs(y1-y2); return sqrt(xx*xx+yy*yy); } int main() { scanf("%d",&n); for (int i=0;i<n;i++) { scanf("%d %d",&point[i].x,&point[i].y); } for (int i=0;i<n;i++) for (int j=i+1;j<n;j++) { maxn=max(maxn,dis(point[i].x,point[i].y,point[j].x,point[j].y)); } printf("%.6lf\n",maxn); return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - 2点間距離の最大値 ( The longest distance ) |
User | luogu_bot1 |
Language | C++ (GCC 5.4.1) |
Score | 100 |
Code Size | 595 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 128 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:27:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d",&n); ^ ./Main.cpp:30:41: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d %d",&point[i].x,&point[i].y); ^
Judge Result
Set Name | All | ||
---|---|---|---|
Score / Max Score | 100 / 100 | ||
Status |
|
Set Name | Test Cases |
---|---|
All | 00_max.txt, 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, 00_sample_04.txt, 00_sample_05.txt, 01_rnd_00.txt, 01_rnd_01.txt, 01_rnd_02.txt, 01_rnd_03.txt, 01_rnd_04.txt, 01_rnd_05.txt, 01_rnd_06.txt, 01_rnd_07.txt, 01_rnd_08.txt, 01_rnd_09.txt, 01_rnd_10.txt, 01_rnd_11.txt, 01_rnd_12.txt, 01_rnd_13.txt, 01_rnd_14.txt, 01_rnd_15.txt, 01_rnd_16.txt, 01_rnd_17.txt, 01_rnd_18.txt, 01_rnd_19.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
00_max.txt | AC | 1 ms | 128 KB |
00_sample_01.txt | AC | 1 ms | 128 KB |
00_sample_02.txt | AC | 1 ms | 128 KB |
00_sample_03.txt | AC | 1 ms | 128 KB |
00_sample_04.txt | AC | 1 ms | 128 KB |
00_sample_05.txt | AC | 1 ms | 128 KB |
01_rnd_00.txt | AC | 1 ms | 128 KB |
01_rnd_01.txt | AC | 1 ms | 128 KB |
01_rnd_02.txt | AC | 1 ms | 128 KB |
01_rnd_03.txt | AC | 1 ms | 128 KB |
01_rnd_04.txt | AC | 1 ms | 128 KB |
01_rnd_05.txt | AC | 1 ms | 128 KB |
01_rnd_06.txt | AC | 1 ms | 128 KB |
01_rnd_07.txt | AC | 1 ms | 128 KB |
01_rnd_08.txt | AC | 1 ms | 128 KB |
01_rnd_09.txt | AC | 1 ms | 128 KB |
01_rnd_10.txt | AC | 1 ms | 128 KB |
01_rnd_11.txt | AC | 1 ms | 128 KB |
01_rnd_12.txt | AC | 1 ms | 128 KB |
01_rnd_13.txt | AC | 1 ms | 128 KB |
01_rnd_14.txt | AC | 1 ms | 128 KB |
01_rnd_15.txt | AC | 1 ms | 128 KB |
01_rnd_16.txt | AC | 1 ms | 128 KB |
01_rnd_17.txt | AC | 1 ms | 128 KB |
01_rnd_18.txt | AC | 1 ms | 128 KB |
01_rnd_19.txt | AC | 1 ms | 128 KB |