For this Question: There are n students in a class. The teacher gives x chocolates to be distributed among the students. The goodness of the class is the bitwise OR of the number of students in the class and the number of chocolates the teacher has given. Find the goodness of the class.The input consists of two space separated integers n and x.

<b>Constraints</b>
1 &le; n &le; 10<sup>5</sup>
1 &le; x &le; 10<sup>5</sup>Print the goodness of the class.<b>Sample Input 1</b>
100 5
<b>Sample Output 1</b>
101

<b>Sample Input 1</b>
64 7
<b>Sample Output 1</b>
71, I have written this Solution Code: #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
#define int long long int
#define endl '\n'
void fastio()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
}
using namespace __gnu_pbds;
const int M = 1e9 + 7;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds;

// Author:Abhas
void solution()
{
    int n, x;
    cin >> n >> x;
    int ans = n | x;
    cout << ans << endl;
}
signed main()
{
    fastio();
    int t = 1;
    // cin >> t;
    while (t--)
    {
        solution();
    }
    return 0;
}, In this Programming Language: C++, Now tell me if this Code is compilable or not?