Run ID | 作者 | 问题 | 语言 | 测评结果 | Time | Memory | 代码长度 | 提交时间 |
---|---|---|---|---|---|---|---|---|
124891 | 曹老师 | 两个数的最小距离 | C++ | Wrong Answer | 2 MS | 272 KB | 496 | 2025-07-12 16:42:25 |
// // Created by CCG on 25-7-11. // #include<iostream> #include <iostream> using namespace std; int main() { int a[1001] = {},min = 99999999999; int n; cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i]; } for (int i = 1; i <= n; i++) { for (int j = i + 1; j <= n; j++) { int s = abs(a[i] - a[j]); if (s < min) { min = s; } } } cout << min; return 0; }
------Input------
2 -2147483648 2147483647
------Answer-----
4294967295
------Your output-----
1