For this Question: In a cricket tournament, there are n teams. Each team plays twice against every other team which includes one home match and another away match. Find out the total number of matches played in the tournament.The input consists of an integer n.

<b>Constraints</b>
1 &le; n &le; 10<sup>5</sup>Print the total number of matches played in the tournament.<b>Sample Input 1</b>
8
<b>Sample Output 1</b>
56

<b>Sample Input 1</b>
10
<b>Sample Output 1</b>
90, 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;
    cin >> n;
    cout << n * (n - 1) << 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?