Run ID:118670

提交时间:2025-05-10 09:07:30

#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 n,m; cin>>n>>m; int a[n][m]; for(int i=0;i<n;i++){ for(int j=0;j<m;j++) cin>>a[i][j]; } for(int j=0;j<m;j++){ for(int i=n-1;i>=0;i--){ cout<<a[i][j]<<" "; } cout<<endl; } int a[100][100]; int n, m; cin >> n >> m; for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { cin >> a[i][j]; } } for (int i = 0; i < n; i++) { if (a[i][i] == a[i][n - 1 - i]) { a[i][i] += m; continue; } a[i][i] += m; a[i][n - 1 - i] += m; } for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { printf("%5d", a[i][j]); } cout << endl; } */ long long a[1005]; int n; long long t; cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i]; } long long min = abs (a[1] - a[2]); for (int i = 1; i <= n; i++) { for (int j = i + 1; j <= n; j++) { t = abs(a[i] - a[j]); if (t < min) { min = t; } } } cout << min; return 0; } cout << min;