| Run ID | 作者 | 问题 | 语言 | 测评结果 | Time | Memory | 代码长度 | 提交时间 |
|---|---|---|---|---|---|---|---|---|
| 132682 | 胡皓宇 | 两个数的最小距离 | Python3 | Wrong Answer | 60 MS | 3752 KB | 178 | 2025-10-12 10:23:18 |
b = [] n = int(input()) a = list(map(int,input().split())) for i in range(n+1): for j in range(n+1): if i != j: print(abs(a[i]-a[j])) print(min(b))
------Input------
79 -1665227684 -895844781 1221608499 -964305153 -895198681 522723254 444672734 1808916495 1994680172 -1179319139 -289974733 -924296047 836454324 -1783984429 1108527955 -739605933 -289298993 -1923720840 667858976 476244695 -1676089289 191438504 1862984370 -653248244 -1342345625 115820572 -1004254242 2146887921 1279171213 1525784403 -53241408 1730714858 1155166948 -1594268325 -446647624 497434833 -975220477 1418805968 -1987562118 2095217452 744295972 625427042 -302518341 1075169041 -207278422 1105
------Answer-----
322746
------Your output-----
769382903 2886836183 700922531 770029003 2187950938 2109900418 3474144179 3659907856 485908545 1375252951 740931637 2501682008 118756745 2773755639 925621751 1375928691 258493156 2333086660 2141472379 10861605 1856666188 3528212054 1011979440 322882059 1781048256 660973442 3812115605 2944398897 3191012087 1611986276 3395942542 2820394632 70959359 1218580060 2162662517 690007207 3084033652 322334434 3760445136 2409523656 2290654726 1362709343 2740396725 1457949262 2770631651 2137060622 2380958980