Submission #32561306

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
typedef pair<ll,ll> Pll;
typedef pair<string,string> Pstring;
typedef pair<double,double> Pdouble;


#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define Precision13 cout << fixed << setprecision(13)
const double PI=3.14159265358979323846;
const int MAX = 510000;
const int MOD = 1000000007;
const int INF = 1<<29;
using Graph = vector<vector<ll>>;

int main() {


  vector<ll> h(4);
  vector<ll> w(4);

  ll sumh=0;
  ll sumw=0;

  REP1(i,3){
    cin >> h[i];
    sumh+=h[i];
  }
  REP1(i,3){
    cin >> w[i];
    sumw+=w[i];
  }

  if(sumh!=sumw){
    cout << 0 << endl;
    return 0;
  }

  ll count =0;

  REP1(i,28){
    REP1(j,28){
      REP1(m,28){
        REP1(n,28){
          ll C=h[1]-(i+j);
          ll F=h[2]-(m+n);
          ll G=w[1]-(i+m);
          ll H=w[2]-(j+n);

          if(h[3]-(G+H)==w[3]-(C+F)){
            if(C>0&&F>0){
              if(G>0&&H>0){
                if(h[3]-(G+H)>0){
                  count++;
                }
              }
            }
            
          }
        }
      }
    }
  }

  cout<< count << endl;

}

Submission Info

Judge Result