Submission #2543910

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<ll,ll> P;

const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const ll INF = 1LL<<29;
const ll mod = 1e9+7;

#define rep(i, a, b) for(ll (i) = (a); (i) < (b);++i)

int main()
{
  int A, B, C, X;
  cin >> A >> B >> C >> X;
  int cnt = 0;
  for (int i = 0; i < A; ++i)
  {
    for (int j = 0; j < B; ++j)
    {
      for (int k = 0; k < C; ++k)
      {
        if (i + j + k == X)
        {
          cnt++;
        }
      }
    }
  }
  cout << cnt << endl;
  return 0;
}

Submission Info

Judge Result