Submission #3776309

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <string>
#include <cmath>
#include <iomanip>
#include <numeric>
#include <cmath>

using namespace std;

#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define SORT(c) sort((c).begin(), (c).end())
#define INF (ll)1e18
#define MOD (ll)1e9 + 7
#define pb push_back

typedef long long ll;
typedef long long int llt;
typedef pair<int, int> P;
typedef vector<int> V;
typedef map<int, int> M;

int main(void){
    cin.tie(0);
   	ios::sync_with_stdio(false);
    int k, s;
    cin >> k >> s;
    int cnt = 0, x, y, z;
    for (x = 0; x <= k;x++){
        for (y = 0; y <= k;y++){
            z = s - x - y;
            if(0<=z&&z<=k)
                cnt++;
        }
    }
    cout << cnt << endl;
    return 0;
}

Submission Info

Judge Result