For this Question: Emily was playing with triplets. She was excited to find out how many triples of non-negative integers (a, b, c) satisfy a+b+c≤S and a×b×c≤T, where S & T are non-negative integers.The input line contains S, and T separated by space.

<b>Constraints</b>
0&le;S&le;100
0&le;T&le;10000
S and T are integers.Print the number of triples of non-negative integers (a, b, c) satisfying the conditions.<b>Sample Input 1</b>
1 0

<b>Sample Output 1 </b>
4

<b>Sample Input 2</b>
2 5

<b>Sample Output 2 </b>
10

<b>Sample Input 3</b>
10 10

<b>Sample Output 3 </b>
213

(In example 1,the triplets are(0,0,0),(0,0,1),(0,1,0) and (1,0,0), I have written this Solution Code: #include<bits/stdc++.h>
using namespace std;
int main(){
    int S, T; cin >> S >> T;
    int cnt = 0;
    for(int a = 0; a <= S; a++){
        for(int b = 0; a+b <= S; b++){
            for(int c = 0; a+b+c <= S; c++){
                if(a*b*c <= T) cnt++;
            }
        }
    }
    cout << cnt << endl;
}, In this Programming Language: C++, Now tell me if this Code is compilable or not?