| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 108899 | 方文轩 | 数列极差问题 | C++ | Wrong Answer | 0 | 0 MS | 256 KB | 373 | 2023-11-04 11:32:08 |
#include<bits/stdc++.h> using namespace std; int a[250]; int b[250]; int main(){ int x; cin>>x; while(x!=0){ for(int i=1;i<=x;i++){ cin>>a[i]; } sort(a+1,a+x+1); for(int i=1;i<=x;i++){ b[x-i+1]=a[i]; } int max=a[1],min=b[1]; for(int i=2;i<=x;i++){ max=max*a[i]+1; min=min*b[i]+1; } cout<<max-min<<endl; cin>>x; } }