Submission #2122734
Source Code Expand
#include <stdio.h> #include <math.h> int main(int argc, char const *argv[]) { int N; scanf("%d", &N); int x[N]; int y[N]; for (int i = 0; i < N; i++) { scanf("%d%d", &x[i], &y[i]); } float d2 = 0; float s2 = 0; for (int i = 0; i < N; i++) { for (int j = i + 1; j < N; j++) { s2 = (x[i] - x[j])*(x[i] - x[j]) + (y[i] - y[j])*(y[i] - y[j]); if (s2 > d2) { d2 = s2; } } } printf("%f\n", sqrt(d2)); return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - 2点間距離の最大値 ( The longest distance ) |
User | masan4444 |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 494 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 128 KB |
Compile Error
./Main.cpp: In function ‘int main(int, const char**)’: ./Main.cpp:6:18: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d", &N); ^ ./Main.cpp:10:32: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d%d", &x[i], &y[i]); ^
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 |