[알고리즘] 백준 11328 - Strfry (C++)

[문제 링크] : https://www.acmicpc.net/problem/11328

#include <iostream>
#include <cstring>
using namespace std;

int N;
int Arr[26];
bool flag;

int main(){
    cin >> N;

    string A, B;
    
    while(N--){
        cin >> A >> B;
        memset(Arr, 0, sizeof(Arr));
        flag = true;

        for(int i=0; i<A.size(); i++){
            Arr[A[i] - 'a']++;
            Arr[B[i] - 'a']--;
        }

        for(int i=0; i<26; i++){
            if(Arr[i] != 0){
                flag = false;
                break;
            }
        }

        if(flag == true){
            cout << "Possible\n";
        }
        else{
            cout << "Impossible\n";
        }
    }

    return 0;
}