UVa 1339: Ancient Cipher

来源：互联网发布：淘宝刷单 php源码编辑：程序博客网时间：2024/06/06 20:32

#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;}

0 0