UVa 1339: Ancient Cipher

最新推荐文章于 2021-04-03 16:58:59 发布

Snail_Walker

最新推荐文章于 2021-04-03 16:58:59 发布

阅读量753

点赞数

分类专栏： UVa Coding Practice 文章标签： uva 1339 easy

本文链接：https://blog.csdn.net/c602273091/article/details/54233818

版权

UVa Coding Practice 专栏收录该内容

22 篇文章 0 订阅

订阅专栏

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

int cmp(const void *a, const void *b)
{
    return *(int *)a - *(int *)b;
}

int main()
{
    char strA[100];
    char strB[100];
    char *tmp = NULL;
    while (scanf_s("%s", strA) != EOF)
    {
        int cnt1[26] = { 0 };
        int cnt2[26] = { 0 };
        scanf_s("%s", strB);
        int lenA = strlen(strA);
        int lenB = strlen(strB);
        for (tmp = strA; tmp < strA + lenA; tmp++)
        {
            cnt1[*tmp - 'A'] ++;
        }
        for (tmp = strB; tmp < strB + lenB; tmp++)
        {
            cnt2[*tmp - 'A'] ++;
        }
        if (lenA != lenB)
        {
            printf("NO\n");
            return 0;
        }
        else
        {
            qsort(cnt1, 26, sizeof(int), cmp);
            qsort(cnt2, 26, sizeof(int), cmp);
            int i = 0;
            for (i = 0; i < 26; i++)
            {
                if (cnt1[i] != cnt2[i])
                {
                    printf("NO\n");
                    break;
                }
                else if (i == 25)
                {
                    printf("YES\n");
                }
            }
        }
    }
    return 0;
}