fork download
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define ll long long
  4. #define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
  5. #define pb push_back
  6. #define alls(x) x.begin(), x.end()
  7. #define sz(x) (int)(x.size())
  8. #define forn(i,n) for(int i=0; i<int(n); i++)
  9. #define rep(i,n) for(int i=1; i<=int(n); i++)
  10. #define inc(i,l,r,d) for(int i=l; i<=r; i+=d)
  11. #define dec(i,r,l,d) for(int i=r; i>=l; i-=d)
  12. #define dbg(x) cerr << #x << " = " << x << endl;
  13. #define nl cout << "\n";
  14. #define sp cout << " ";
  15. #define pii pair<int, int>
  16. #define pll pair<ll, ll>
  17. #define vll vector<ll>
  18. #define vi vector<int>
  19. const ll inf = 1e16;
  20. const ll mod = 998244353;
  21. const ll mod1 = 1e9 + 87;
  22. const ll mod2 = 127397154761;
  23. ll gcd(ll a, ll b) {if (b == 0) return a; return gcd(b, a % b);}
  24. ll lcm(ll a, ll b) {return a * b / gcd(a, b);}
  25. ll sum(ll a, ll b) {a += b; if (a >= mod) a -= mod; return a;}
  26. ll sub(ll a, ll b) {a -= b; if (a < 0) a += mod; return a;}
  27. ll mul(ll a, ll b) {return a * b % mod;}
  28.  
  29.  
  30. //========================================
  31. //Author: Muntazir Ali
  32. //Institution: IIIT JABALPUR
  33. //========================================
  34.  
  35. void ali(){
  36. int n;
  37. cin >> n;
  38. vi a(n);
  39. for(int i=0; i<n; i++) cin >> a[i];
  40. int ans=0;
  41. for(int i=0; i<n; i++){
  42. for(int j=0; j<n; j++){
  43. if(j==i) continue;
  44. for(int k=j+1; k<n; k++){
  45. if(k==i) continue;
  46. int value=a[i]%(a[j]+a[k]);
  47. if(value>ans) ans=value;
  48. }
  49. }
  50. }
  51. cout << ans << endl;
  52. }
  53. int main(){
  54. fast
  55. int t;
  56. cin >> t;
  57. while(t--){
  58. ali();
  59. }
  60. return 0;
  61. }
  62.  
  63.  
Success #stdin #stdout 0.01s 5288KB
stdin
2
3
1 2 3
3
1 3 3
stdout
2
3