算法训练 Anagrams问题

#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
char s1[85],s2[85];
int l1,l2;
int a[85],b[85];
bool f=true;
int main()
{
	scanf ("%s%s",s1,s2);
	l1=strlen(s1);
	l2=strlen(s2);
	if (l1!=l2) printf ("N\n");
	else {
		for (int i=0;i<l1;i++) {
			if (s1[i]>='A' && s1[i]<='Z') a[i]=s1[i]-'A';
			else if (s1[i]>='a' && s1[i]<='z') a[i]=s1[i]-'a';
			if (s2[i]>='A' && s2[i]<='Z') b[i]=s2[i]-'A';
			else if (s2[i]>='a' && s2[i]<='z') b[i]=s2[i]-'a';
		}
		sort(a,a+l1);
		sort(b,b+l2);
		for (int i=0;i<l1;i++) {
			if (a[i]!=b[i]) {
				printf ("N\n");
				f=false;
				break;
			}
		}
		if (f==true) printf ("Y\n");
	}
	return 0;
}