POJ-2159

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

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

char a[101], b[101];
main()
{
      char str[101], src[101];
      int i, j;
      scanf("%s%s", str, src);
      qsort(str, strlen(str), sizeof(char), scmp);
      qsort(src, strlen(src), sizeof(char), scmp);
      a[0] = b[0] = 1;
      for (i=1, j=0; str[i] != '\0'; i++) {
          if (str[i] == str[i-1])
             a[j]++;
          else
              a[++j]++;
      }
      for (i=1, j=0; src[i] != '\0'; i++) {
          if (src[i] == src[i-1])
             b[j]++;
          else
              b[++j]++;
      }
      qsort(a, strlen(a), sizeof(char), scmp);
      qsort(b, strlen(b), sizeof(char), scmp);      
      if (strcmp(a,b) == 0)
         printf("YES\n");
      else
          printf("NO\n");
}

你可能感兴趣的:(POJ-2159)