Problem

7 /11


Anagrams

Problem

A word is called an anagram of another word if it can be obtained by rearranging its letters.
 
Input
Given two words on separate lines. Words consist of lowercase Latin letters and numbers. Word lengths do not exceed 255.
 
Output
Required to output "YES"  – if the words entered are anagrams of each other, "NO"  – if not.
 
Input Output
sharm
marsh
 YES
pineapples
nnaass
 NO

time 1000 ms
memory 256 Mb
Rules for program design and list of errors in automatic problem checking

Teacher commentary

Your Program

Attach a file with the source code of the program:

or select a programming language and type your program

Auto

       

Program check result To check the solution of the problem, you need to register or log in!