Submission #1983456

---

Source Code Expand

#include <iostream>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <algorithm>
#include <tuple>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <cstdio>
#include <numeric>
#define REP(i, n) for(LL i = 0;i < n;i++)
#define REPR(i, n) for(LL i = n;i >= 0;i--)
#define FOR(i, m, n) for(LL i = m;i < n;i++)
#define FORR(i, m, n) for(LL i = m;i >= n;i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define pb(a) push_back(a)
#define all(x) (x).begin(),(x).end()
#define INF 999999999
#define MOD 1000000007
using namespace std;
typedef long long LL;
typedef pair<int, int> P;
typedef pair<LL, LL> LP;
typedef pair<int, P> PP;
typedef pair<LL, LP> LPP;
int dy[]={0, 0, 1, -1, 0};
int dx[]={1, -1, 0, 0, 0};

/*************** using variables ***************/
int k, s;
int ans = 0;
/**********************************************/

int main(){
    cin >> k >> s;
    
    FOR(i, 0, k+1){
        FOR(j, i, k+1){
            if(i+j+(s-i-j) == s && (s-i-j) <= k && (s-i-j) > 0){
                if(i == j && i == (s-i-j)) ans++;
                else if(i == j || j == (s-i-j) || (s-i-j) == i) ans += 3;
                else ans += 6;
                //cout << i << " " << j << " " << (s-i-j) << endl;
            }
        }
    }

    cout << ans << endl;
}

Submission Info

Judge Result