Submission
Status:
PPPPPPPPPP
Subtask/Task Score:
100/100
Score: 100
User: kf._.exe
Problemset: อะนาแกรม 1
Language: cpp
Time: 0.002 second
Submitted On: 2025-09-11 22:14:14
/*
* LANG : C++ (g++ version 17).
* Author: Fiw (Piyaphat) , Instagram: piyaph4t.hexa
* Problem : c1_su63_anagram1
*/
#include <bits/stdc++.h>
using namespace std;
// === Type Aliases ===
using ll = long long;
using db = double;
using ld = long double;
template<typename T> using vec = vector<T>;
template<typename T1, typename T2> using _p = pair<T1, T2>;
template<typename T1, typename T2> using uset = unordered_set<T1,T2>;
template<typename T1, typename T2> using umap = unordered_map<T1,T2>;
template<typename T> using _st = stack<T>;
template<typename T> using _qe = queue<T>;
template<typename T> using _dq = deque<T>;
template<typename T> using _pq = priority_queue<T>;
template<typename T> using _pqg = priority_queue<T, vector<T>, greater<T>>;
// === Constants ===
const ll INF = 1e18;
const int MOD = 1e9 + 7;
const double EPS = 1e-9;
const int dx[4] = {0, 0, 1, -1};
const int dy[4] = {1, -1, 0, 0};
// === Fast IO ===
#define fastio ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
// === Macros ===
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define ff first
#define ss second
#define sz(x) (int)(x).size()
#define rep(i,a,b) for(int i = (a); i < (b); ++i)
#define per(i,a,b) for(int i = (a); i >= (b); --i)
#define each(x,a) for(auto& x : a)
#define endl '\n' // If using interactive problems, remove this.
#define YES cout << "YES"
#define NO cout << "NO"
#define EMP cout << "empty"
#define _mx(a,b) a=max(a,b)
#define _mn(a,b) a=min(a,b)
// === Debug ===
#define dbg(x) cerr << #x << " = " << x << endl
// === Tools ===
template<typename T>
void _inVec(size_t n, vector<T> & inp){
inp.resize(n);
each(x , inp) cin >> x;
}
// === variable ===
//cosnt ll maxn = 1e5;
//
// === Solve Function ===
void solve() {
// logic here
int ans[8]{};
string s;cin >> s;
each(x,s) ++ans[(int)x-(int)'A'];
each(x,ans) cout << x << " ";
cout << endl;
}
// === Main ===
int32_t main() {
fastio;
solve();
return 0;
}