For this Question: You are given a grid of dimensions N*N. When you blast a bomb at cell (i, j) all the cells of row i and column j get damaged. You have 5 bombs. Find the number of ways you can choose 5 cells to place these bombs in so that the maximum number of cells gets damaged.Input contains a single integer N.

Constraints 
5 <= N <= 100Output a single integer which is the number of ways you can choose 5 cells to place the bombs in so that maximum number of cells get damaged.Sample Input 1
5

Sample output 1
120

Sample Input 2
6

Sample Output 2
4320

Explanation:-
For test1:- 
for maximum blast:-
their are 5 ways to place bomb 1
their are 4 ways to place bomb 2
their are 3 ways to place bomb 3
their are 2 ways to place bomb 4
their is 1 way to place bomb 5
so total number of ways will be= 5*4*3*2*1 =120, I have written this Solution Code: #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define VV vector
#define pb push_back
#define bitc  __builtin_popcountll
#define m_p make_pair
#define infi 1e18+1
#define eps 0.000000000001
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);
string char_to_str(char c){string tem(1,c);return tem;}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template<class T>//usage rand<long long>()
T rand() {
    return uniform_int_distribution<T>()(rng);
}
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
 
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> oset;
// string to integer stoi()
// string to long long stoll()
// string.substr(position,length);
// integer to string to_string();
 
//////////////
auto clk=clock();
#define all(x) x.begin(),x.end()
#define S second
#define F first
#define sz(x) ((long long)x.size())
#define int long long  
#define f80 __float128
#define pii pair<int,int>
/////////////
signed main()
{
	fastio;
	#ifdef ANIKET_GOYAL
		freopen("inputf.in","r",stdin);
		freopen("outputf.in","w",stdout);
	#endif
	int N; 
	cin>>N;
 
    int pick = ((N) * (N - 1) * (N - 2) * (N - 3) * (N - 4)) / 120;
    cout<<(pick * pick * 120);
	#ifdef ANIKET_GOYAL
		cout<<endl<<endl<<endl<<endl<<"Time elapsed: "<<(double)(clock()-clk)/CLOCKS_PER_SEC<<endl;
	#endif
}, In this Programming Language: C++, Now tell me if this Code is compilable or not?