Source Code
#include <iostream>
#include <cstring>
#include <cmath>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
using namespace std;

typedef long long ll;
#define forn(i, n) for (int i = 0; i < int(n); i++)
#define FastIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define all(c) (c.begin(), c.end())
#define rall(c) c.begin(), c.end(), greater<int>()

void solve() {
	string t;

	forn(i, 13) {
		t.push_back(i + 'A');
	}

	string s; cin >> s;
	sort(s.begin(), s.end());

	cout << (s == t ? "YES\n" : "NO\n");
}

int main(void) {
	FastIO;
	int t = 1;
	cin >> t;
	while (t--) {
		solve();
	}
	return 0;
}
Copy
Well-indexed? misterRoshi22
GNU G++17
8 ms
644 KB
Accepted