1868589_ac_45ms_24k.c

来自「北大大牛代码 1240道题的原代码 超级权威」· C语言 代码 · 共 51 行

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

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

int main()
{
  int i, j;
  int m, n;
  char ch1, ch2;
  char a[27], b[27];
  char str1[102], str2[102];
  
  scanf("%s%s",str1,str2);
  memset(a,'0',27);
  memset(b,'0',27);
  m = n = 0;
  for(i = 0; str2[i]!='\0'; i++)
  {
   ch2 = str2[i];
   if(ch2=='6') continue;
   for(j = i; str2[j]!='\0'; j++)
   {
    if(str2[j]==ch2)
      {str2[j]='6';a[m]++;}
   }
   m++;
  }
    for(i = 0; str1[i]!='\0'; i++)
  {
   ch1 = str1[i];
   if(ch1=='6') continue;
   for(j = i; str1[j]!='\0'; j++)
   {
    if(str1[j]==ch1)
      {str1[j]='6';b[n]++;}
   }
   n++;
  }
  qsort(a,m,sizeof(a[0]),cmp);
  qsort(b,n,sizeof(b[0]),cmp);
  a[m] = b[n] = '\0';
  if(strcmp(a,b)==0)
   printf("YES\n");
  else
   printf("NO\n");
}