Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- using namespace std;
- string uniq(string s)
- {
- int i,j;
- int n = s.length();
- for(i=0;i<n;i++)
- {
- for(j=i+1;j<n;j++)
- {
- if(s[i]==s[j])
- {
- s[j] ='\0';
- }
- }
- }
- for(i=0;i<s.length();i++)
- {
- s.erase(std::remove(s.begin(), s.end(), '\0'), s.end());
- }
- return s;
- }
- int main()
- {
- long long int i,j,k,m=0,l,n,o=0,p=0,x;
- map<char ,int> ma,mb;
- map<char ,int> ::iterator im;
- string s,c;
- cin>>n;
- for(i=1;i<=n;i++)
- {
- cin>>s>>c;
- sort(s.begin(),s.end());
- sort(c.begin(),c.end());
- if(uniq(s)==uniq(c))
- {
- cout<<"YES"<<endl;
- }
- else
- {
- cout<<"NO"<<endl;
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement