![](https://www.cnblogs.com/Images/OutliningIndicators/ExpandedBlockStart.gif)
/**//**************************************
Problem: POJ 2159 Ancient Cipher
Time: 16MS
Memory: 204K
Accepted Time: 2009-05-16 11:53:29
Tips: 读懂题意
**************************************/
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
int mycmp(const void *p1,const void *p2)
![](https://www.cnblogs.com/Images/OutliningIndicators/ExpandedBlockStart.gif)
![](https://www.cnblogs.com/Images/OutliningIndicators/ContractedBlock.gif)
{
return *(int*)p1-*(int*)p2;
}
int main()
![](https://www.cnblogs.com/Images/OutliningIndicators/ExpandedBlockStart.gif)
![](https://www.cnblogs.com/Images/OutliningIndicators/ContractedBlock.gif)
{
char str1[109],str2[109];
int num1[26],num2[26],i;
scanf("%s%s",str1,str2);
int len=strlen(str1);
memset(num1,0,sizeof(num1));
memset(num2,0,sizeof(num2));
for(i=0;i<len;i++)
![](https://www.cnblogs.com/Images/OutliningIndicators/ExpandedSubBlockStart.gif)
{
num1[str1[i]-'A']++;
num2[str2[i]-'A']++;
}
qsort(num1,26,sizeof(int),mycmp);
qsort(num2,26,sizeof(int),mycmp);
int flag=0;
for(i=0;i<26;i++)
![](https://www.cnblogs.com/Images/OutliningIndicators/ExpandedSubBlockStart.gif)
{
if(num1[i]!=num2[i])break;
}
if(i<26)printf("NO\n");
else printf("YES\n");
return 0;
}
![](https://www.cnblogs.com/Images/OutliningIndicators/None.gif)
posted @
2009-05-16 11:57
主函数
阅读(
235)
评论()
编辑
收藏
举报