K - Ancient Cipher UVA - 1339

Ancient Roman empire had a strong government system with various departments, including a secretservice department. Important documents were sent between provinces and the capital in encryptedform to prevent eavesdropping. The most popular ciphers in those
times were so called substitutioncipher and permutation cipher.Substitution cipher changes all occurrences of each letter to some other letter. Substitutes for allletters must be different. For some letters substitute letter may coincide with the original
letter. Forexample, applying substitution cipher that changes all letters from ‘A’ to ‘Y’ to the next ones in thealphabet, and changes ‘Z’ to ‘A’, to the message “VICTORIOUS” one gets the message “WJDUPSJPVT”.Permutation cipher applies some permutation to
the letters of the message. For example, applyingthe permutation ⟨2, 1, 5, 4, 3, 7, 6, 10, 9, 8⟩ to the message “VICTORIOUS” one gets the message“IVOTCIRSUO”.It was quickly noticed that being applied separately, both substitution cipher and permutationcipher
were rather weak. But when being combined, they were strong enough for those times. Thus,the most important messages were first encrypted using substitution cipher, and then the result wasencrypted using permutation cipher. Encrypting the message “VICTORIOUS”
with the combination ofthe ciphers described above one gets the message “JWPUDJSTVP”.Archeologists have recently found the message engraved on a stone plate. At the first glance itseemed completely meaningless, so it was suggested that the message was encrypted
with some substitutionand permutation ciphers. They have conjectured the possible text of the original message thatwas encrypted, and now they want to check their conjecture. They need a computer program to do it,so you have to write one.InputInput file contains
several test cases. Each of them consists of two lines. The first line contains themessage engraved on the plate. Before encrypting, all spaces and punctuation marks were removed, sothe encrypted message contains only capital letters of the English alphabet.
The second line containsthe original message that is conjectured to be encrypted in the message on the first line. It also containsonly capital letters of the English alphabet.The lengths of both lines of the input file are equal and do not exceed 100.OutputFor
each test case, print one output line. Output ‘YES’ if the message on the first line of the input filecould be the result of encrypting the message on the second line, or ‘NO’ in the other case.Sample InputJWPUDJSTVPVICTORIOUSMAMAROMEHAHAHEHEAAAAAANEERCISTHEBESTSECRETMESSAGESSample
O

#include <iostream>
#include<cstdio>
#include<cstring>
#include<string.h>
#include<string>
#include<stdio.h>
#include<algorithm>
#include<stack>
using namespace std;
int main()
{
char s1[101];
char s2[101];
int a[101];
int b[101];
int i;
while(scanf("%s %s",s1,s2)!=EOF)
{
int l=strlen(s1);
int a1=0;
int a2=0;
int f=0;
if(strlen(s1)!=strlen(s2))
{
printf("NO\n");
continue;
}
memset(a,0,sizeof(a));
memset(b,0,sizeof(b));
for(i=0; i<strlen(s1); i++)
a[s1[i]]++;
for(i=0; i<strlen(s2); i++)
b[s2[i]]++;
sort(a,a+101);
sort(b,b+101);
for(i=0; i<101; i++)
{
if(a[i]!=b[i])
{
f=1;
break;
}
}
if(f==0)
printf("YES\n");
else
printf("NO\n");
}
return 0;
}

utputYESNOYESYESNO