Enchanted Mirror 20.08.13

#include <stdio.h>
#include <math.h>
#include <stdlib.h>
#include <string.h>
#include <ctype.h>
#include <bitset>
#include <iostream>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <algorithm>
using namespace std;

char a[110], b[110];
vector< pair<char, char> > v1, v2;
int l;

int main() {
    freopen("enchanted.in", "r", stdin);
    freopen("enchanted.out", "w", stdout);
    scanf("%s\n%s\n", a, b);
    l = strlen(a);
    for (int i = 0; i < l; i++)
        v1.push_back(make_pair(a[i], b[l - 1 - i]));
    scanf("%s\n%s\n", a, b);
    for (int i = 0; i < l; i++)
        v2.push_back(make_pair(a[i], b[l - 1 - i]));
    sort(v1.begin(), v1.end());
    sort(v2.begin(), v2.end());
    for (int i = 0; i < v1.size(); i++) {
        if (v1[i] != v2[i]) {
            printf("No");
            return 0;
        }
    }
    printf("Yes");

    return 0;
}