Submission

Score: 0

User: matcherbrainner

Problemset: อะนาแกรม 2

Language: cpp

Time: 0.004 second

Submitted On: 2026-10-04 11:26:57

#include <bits/stdc++.h>
using namespace std;
int main() {
    string s,b;
    cin >> s>>b;
    int count[8] = {0};
    for (char c : s) {
        count[c - 'A']++;
    }
    for (int i = 0; i < 8; i++) {
        cout << count[i] << " ";
    }
    cout<<"\n";
     int counts[8] = {0};
    for (char c : b) {
        count[c - 'A']++;
    }
    for (int i = 0; i < 8; i++) {
        cout << counts[i] << " ";
    }
    cout<<"\n";
    int win[8];
    for(int i=0;i<8;i++){
		win[i]=abs((count[i]-'0')-(counts[i]-'0'));    	
	}
	int snt=0;
	for(int i=0;i<8;i++){
		if(count[i]!=counts[i]){
			snt++;
		}
	}
	for(int i=0;i<8;i++){
		cout<<win[i]<<" ";
	}
	cout<<"\n";
	if(snt>3){
		cout<<"no";
	}
	else{
		cout<<"anangram";
	}
}