For this Question: Two strings are completely different if the characters of one string cannot be rearranged to form the other string. Given a string find the number of completely different substrings of the string.The first line of the input contains a string S.

<b>Constraints:</b>
1 <= |S| <= 100
The string contains only lowercase English letters.The output should contain number of completely different substrings.Sample Input
abc

Sample Output
6

Sample Input
aaa

Sample Output
3, I have written this Solution Code: #include "bits/stdc++.h"
#pragma GCC optimize "03"
using namespace std;
 
#define int long long int
#define ld long double
#define pi pair<int, int>
#define pb push_back
#define fi first
#define se second
#define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#ifndef LOCAL
#define endl '\n'
#endif
 
const int N = 2e5 + 5;
const int mod = 1e9 + 7;
const int inf = 1e9 + 9;

signed main() {
	IOS;
	string s;	cin >> s;
	int n = s.length();
	set<string> p;
	for(int i = 0; i < n; i++){
		string t = "";
		for(int j = i; j < n; j++){
			t += s[j];
			sort(t.begin(), t.end());
			p.insert(t);
		}
	}	
	cout << p.size();
	return 0;
}, In this Programming Language: C++, Now tell me if this Code is compilable or not?