/BCSEQ1 - Đoạn số có tổng bằng nhau

              #include <iostream>
        using namespace std;
         
        int find(long long* arr, int left, int right, long long x) {
          
          while (left <= right) {
            int mid = (left + right) / 2;
         
            if (arr[mid] == x) {
              return mid;
            }
            else {
              if (arr[mid] < x) left = mid + 1;
              else right = mid - 1;
            }
          }
          return 0;
        }
         
        bool divide(long long* arr, int n, int numOfChoice, long long sum) {
          int id = 0;
          for (int i = 1; i <= numOfChoice; i++) {
            int res = find(arr, id, n, arr[id] + sum);
            if (res != 0) {
              id = res;
            }
            else {
              return false;
            }
          }
          return true;
        }
         
        int main() {
          int test;
          cin >> test;
         
          while (test--) {
            int t, n;
            cin >> t >> n;
         
            long long* arr = new long long[n + 2];
            arr[0] = 0;
         
            for (int i = 1; i <= n; i++) {
              cin >> arr[i];
              arr[i] = arr[i - 1] + arr[i];
            }
         
            //cout << arr[n] << endl;
         
            for (int i = n; i >= 1; i--) {
              if (arr[n] % i == 0 && divide(arr, n, i, arr[n] / i)) {
                cout << t << " " << arr[n] / i << endl;
                break;
              }
            }
          }
         
          return 0;
        }