Submission

Score: 100

User: anwaplayz

Problemset: อะนาแกรม 2

Language: cpp

Time: 0.004 second

Submitted On: 2026-09-23 22:26:15

#include <iostream>
#include <cmath>
using namespace std;
int main(){
    string A,B;
    long long aCount[8]={0},bCount[8]={0},strikes=0;
    cin>>A;
    cin>>B;
    long long n1 = A.length();
    long long n2 = B.length();
    for(int i=0;i<n1;i++){
        aCount[A[i]-65]++;
    }
    for(int i=0;i<n2;i++){
        bCount[B[i]-65]++;
    }
    for(int i=0;i<8;i++){
        cout<<aCount[i]<<" ";
    }
    cout<<"\n";
    for(int i=0;i<8;i++){
        cout<<bCount[i]<<" ";
    }
    cout<<"\n";
    for(int i=0;i<8;i++){
        cout<<abs(aCount[i]-bCount[i])<<" ";
        if(abs(aCount[i]-bCount[i])!=0){
            strikes++;
        }
    }
    cout<<"\n";
    if(strikes>3){
        cout<<"no";
    }
    else{
        cout<<"anagram";
    }
}