ZOJ 3844Easy Task(暴力)

直接暴力

#include <algorithm>#include <iostream>#include <cstring>#include <cstdlib>#include <cstdio>#include <string>#include <vector>#include <queue>#include <stack>#include <cmath>#include <ctime>#include <list>#include <set>#include <map>using namespace std;typedef long long ll;#define PB push_back#define UB upper_bound#define LB lower_bound#define MP make_pair#define pii pair<int,int>#define vi vector<int>#define vii vector<vi>#define mst(x,y) memset(x,y,sizeof(x))#define fr(x) freopen(x,"r",stdin)#define fw(x) freopen(x,"w",stdout)#define iin(x) scanf("%d",&x)#define complete_unique(a) a.erase(unique(a.begin(),a.end()),a.end())#define sp system("pause")#define INF 1e9#define MAXN 100005#define PI acos(-1.0)#define eps 1e-10const int MOD = 1e9 + 7;int a[20];int main(){int t;cin>>t;while(t--){int n;cin>>n;for(int i=1;i<=n;++i)cin >> a[i];int x,y;int ti = 0;int Max = -MOD;int Min = MOD;while(1){Max = -MOD;Min = MOD;ti ++;if(ti >= 1000000)break;for(int i=1;i<=n;++i)if(a[i] > Max)Max = a[i],x = i;for(int i=1;i<=n;++i)if(a[i] < Min)Min = a[i],y = i;if(Min == Max)break;a[x] = a[y] = Max - Min;}if(Min == Max)cout<<Max<<endl;elsecout<<"Nooooooo!"<<endl;}return 0;}