Run ID | 作者 | 问题 | 语言 | 测评结果 | Time | Memory | 代码长度 | 提交时间 |
---|---|---|---|---|---|---|---|---|
124944 | 王宇宸 | 两个数的最小距离 | C++ | Output Limit Exceeded | 2 MS | 272 KB | 700 | 2025-07-12 19:44:10 |
#include<iostream> // cin\cout\endl #include<cstdio> //scanf()\printf() #include<cstring> // strcpy()\strcat()\strcmp()\strlen()\memset() #include<cmath> //sqrt()\pow()\abs()\ceil()\floor()\max()\min() using namespace std; int main(){ int a[100] = {}; int n; cin >> n; int min = 1000000; 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++) { cout << a[i] << "," << a[j] << endl; if (abs(a[i] - a[j]) < min) { min = abs(a[i] - a[j]); } } } cout << min; return 0; }