5gGQrE - Online C++0x Compiler & Debugging Tool

#include<bits/stdc++.h>
#define f1(i, n) for(ll i=1;i<=n;++i)
#define f0(i, n) for(ll i=0;i<n;++i)
#define ull unsigned long long
#define ll long long
#define rev(a) reverse(a.begin(),a.end())
#define all(x) x.begin(),x.end()
#define so(A, n) sort(A+1, A+n+1)
using namespace std;
const int maxn = 200010;
const int N = 2e5 + 5;
const ll MOD = 998244353;
ll moded(ll a, ll b, ll mod) {
	return ((a % mod) * (b % mod)) % mod;
}
void bai1() {
	ll a, b, c, d, e, f;
	cin >> a >> b >> c >> d >> e >> f;
	ll res = ((moded(moded(a, b, MOD), c, MOD) % MOD) - ((moded(moded(d, e, MOD), f, MOD)) % MOD)) % MOD;
	cout << res;
}
void bai2() {
	string s;
	cin >> s;
	int cnt = 0;
	for (int i = 0; i < s.size(); ++i) {
		if (s[i] == 'o') {
			cnt++;
		}
	}
	if (cnt > 4) {cout << 0; return;}
	else if (cnt == 4) {cout << 1; return;}

	int res = 0;
	map<int, bool> mp;
	int A[5] = {};
	for (int i = 0; i <= 9999; ++i) {
		int a = i, d = 4;
		while (d != 0) {
			A[d] = a % 10;
			a /= 10;
			--d;
		}
		bool check = true;
		for (int j = 1; j <= 4; ++j) {
			if (s[A[j]] == 'o') {
				mp[A[j]] = true;
			}
			if (s[A[j]] == 'x') {
				check = false;
				break;
			}
		}
		if (mp.size() == cnt && check) {
			res++;
		}
		mp.clear();
	}
	cout << res;
}
int main()
{
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	bai2();


	return 0;
}