//.c
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define maxn 100 + 10
int cmp(const void *a, const void *b)
{
return *(int *)a - *(int *)b;
}
int main()
{
char a[maxn];
char b[maxn];
while(scanf("%s%s", a,b) != EOF)
{
int len = strlen(a);
int cnt1[26],cnt2[26];
memset(cnt1,0,sizeof(cnt1));
memset(cnt2,0,sizeof(cnt2));
for(int i=0; i < len; i++)
{
cnt1[a[i] - 'A']++;
cnt2[b[i] - 'A']++;
}
//排序
qsort(cnt1,26,sizeof(cnt1[0]),cmp);
qsort(cnt2,26,sizeof(cnt2[0]),cmp);
for(int i=0; i < 26; i++)
{
if(cnt1[i] != cnt2[i])
{
printf("NO\n");
return 0;
}
}
printf("YES\n");
}
return 0;
}
//.cpp
#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
#define maxn 100 + 10
bool cmp(const int a, const int b)
{
return a<b;
}
int main()
{
string a,b;
while(cin >> a >> b)
{
int len = a.length();
int cnt1[26],cnt2[26];
memset(cnt1,0,sizeof(cnt1));
memset(cnt2,0,sizeof(cnt2));
for(int i=0; i < len; i++)
{
cnt1[a[i] - 'A']++;
cnt2[b[i] - 'A']++;
}
//排序
sort(cnt1,cnt1+26,cmp);
sort(cnt2,cnt2+26,cmp);
for(int i=0; i < 26; i++)
{
if(cnt1[i] != cnt2[i])
{
cout<<"NO"<<endl;
return 0;
}
}
cout<<"YES"<<endl;
}
return 0;
}
例题4-1 古老的密码 (排序)
最新推荐文章于 2022-08-11 13:09:11 发布