Solution:
//#include
//#include
//#include
//#include
//#include
//#include
//#include
//#include
//#include
//#include
//#include
//#include
//#include
//#include
//#include
//#include
//#include
//#define ll long long
//#define sc scanf
//#define pf printf
//#define pi 2*acos(0.0)
//using namespace std;
//int main()
//{
// string s1,s2,a;
// while(getline(cin,s1))
// {
// getline(cin,s2);
// int l=s1.size();
// int len=s2.size();
// a="";
// for(int i=0;i
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#define ll long long
#define sc scanf
#define pf printf
#define pi 2*acos(0.0)
using namespace std;
int main()
{
string s1,s2;
while(getline(cin,s1))
{
getline(cin,s2);
sort(s1.begin(),s1.end());
sort(s2.begin(),s2.end());
s1.erase(set_intersection(s1.begin(),s1.end(),s2.begin(),s2.end(),s1.begin()),s1.end());
cout<
https://github.com/Shipu/OnlineJudgeProblemSolutionWithCPlusPlus/tree/master/uva/10252/10252.cpp