| Run ID | 作者 | 问题 | 语言 | 测评结果 | Time | Memory | 代码长度 | 提交时间 |
|---|---|---|---|---|---|---|---|---|
| 77306 | LJY | 两个数的最小距离 | C++ | Wrong Answer | 0 MS | 272 KB | 2464 | 2024-06-08 17:47:24 |
# include<stdio.h> #include<iostream> using namespace std; int main(){ /* int minn=1; int maxn=1; int a[1000][1000]; int n; cin>>n; for(int i=1;i<=n;i++){ for(int j=1;j<=n;j++){ cin>>a[i][j]; if(a[i][j]>=maxn){ maxn=a[i][j]; } else if(a[i][j]<minn){ minn=a[i][j]; } } } cout<<minn<<" "<<maxn; */ /*int n,m; int a[100][100]; int b[100][100]; int c[100][100]; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>a[i][j]; } } for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>b[i][j]; } } for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ c[i][j]=a[i][j]+b[i][j]; cout<<c[i][j]<<" "; } cout<<endl; }*/ /*int n,m; int a[100][100]; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>a[i][j]; } } for(int i=1;i<=n;i++){ for(int j=m;j>=1;j--){ cout<<a[i][j]<<" "; } cout<<endl; }*/ /*int i,j,n,m; int a[6][6]; cin>>n>>m; for(i = 1;i <= 5;i++){ for(j = 1;j <= 5;j++){ if(i==n) cin>>a[m][j]; else if(i==m) cin>>a[n][j]; else cin>>a[i][j]; } } for(i = 1;i <= 5;i++){ cout<<a[i][1]; for(j = 2;j <= 5;j++) cout<<" "<<a[i][j]; cout<<endl; } */ /* int n,m; cin>>n>>m; int a[100][100]; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>a[i][j]; } } for(int j=1;j<=m;j++){ for(int i=1;i<=n;i++){ cout<<a[i][j]<<" "; } cout<<endl; }*/ /* int n,m; cin>>n>>m; int a[100][100]; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>a[i][j]; } } for(int j=1;j<=m;j++){ for(int i=n;i>=1;i--){ cout<<a[i][j]<<" "; } cout<<endl; }*/ /* int n,m; cin>>n>>m; int a[n][n]; for(int i=0;i<n;i++){ for(int j=0;j<n;j++){ cin>>a[i][j];if(i==j||i+j==n-1) a[i][j]+=m; } } for(int i=0;i<n;i++){ for(int j=0;j<n;j++){ cout<<" "<<a[i][j]<<" "; } cout<<endl; } */ int n; int a[100]; int maxn=99998; int minn=99999; cin>>n; for(int i=1;i<=n;i++){ cin>>a[i]; if(a[i]<minn){ minn=a[i]; if(a[i]<maxn){ maxn=a[i]; } } } cout<<minn-maxn; return 0; }
------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-----
0