uva12504.cpp

#include<bits/stdc++.h>

using namespace std ;
#define M 1000000
#define pf printf
#define sf scanf
#define sf1(x) scanf("%d",&x)
#define sf2(x,y) scanf("%d %d",&x,&y)
#define pf1(x) printf("%d\n",x)
#define pf2(x,y) printf("%d %d\n",x,y)
#define rep(i,n) for(i = 0 ;i< n ; i++)
#define pb push_back

typedef long long ll ;

vector<string > del;
vector<string > changed ;
vector<string > n_values;

int main(){
   //  freopen("in.txt ","r",stdin);
 //freopen("out.txt ","w",stdout);

int i , j , k, tc ;
sf1(tc);
getchar();
  while(tc--){
    map<string , string>mp;
    map<string , string>:: iterator it;

    char s1[1000] ;
    gets(s1);
    int err = 0;
      for(i = 1; s1[i]!= '}' ; ){
        j = 0 ;
        char key[1000] ,val[1000] ;
        int count  = 0;

          while(1){

            key[j++] = s1[i++];
            if(s1[i] == ':'){
                i++;
                break;
            }
          }
        key[j] =  '\0';

        j = 0;
        count  = 0;
          while(1){
            val[j++] = s1[i++];
            if(s1[i] == ','){
                i++;
            break;

            }
            if(s1[i] == '}'){
                err = 1;
                break;

            }
          }
          val[j] = '\0';
          mp[key ] = val;
    it = mp.find(key);
    if(err ==  1 )
      break;

      }
    gets(s1);
    err = 0;
      for(i = 1; s1[i]!= '}' ; ){
        j = 0 ;
        char key[1000] ,val[1000] ;
        int count  = 0;

          while(1){

            key[j++] = s1[i++];
            if(s1[i] == ':'){
                i++;
                break;
            }
          }
        key[j] =  '\0';

        j = 0;
        count  = 0;
          while(1){
            val[j++] = s1[i++];
            if(s1[i] == ','){
                i++;
            break;

            }
            if(s1[i] == '}'){
                err = 1;
                break;

            }
          }
          val[j] = '\0';
    it = mp.find(key);
    if(it == mp.end()){
      n_values.push_back(key);
    }
    if(it !=  mp.end()){
        if(it->second != val ){
          changed.push_back(key );
        }
          mp.erase(it);
    }



     //   cout << it-> first  << "=> " << it-> second << "\n";
    if(err ==  1 )
      break;

      }
  //sort(mp.begin(), mp.end());
  vector<string> fkk;
  for(it = mp.begin(); it!= mp.end(); it++){
    char key[1000];
//   cout << it->first <<"\n";

      fkk.push_back(it->first);
      }

    sort(fkk.begin() , fkk.end());
    sort(changed.begin(), changed.end());
    sort(n_values.begin(),n_values.end());

    int errflag = 0;
    if(n_values.size() != 0)
    pf("+");  for( i = 0 ;i < n_values.size() ;i++)
    {
      errflag =1;
      if(i!=  n_values.size()-1)
        cout<< n_values[i]<< ",";
        else cout<< n_values[i]<< "\n";

    }
    n_values.clear();
    if(fkk.size() != 0)
      pf("-");
      for( i = 0 ;i < fkk.size() ;i++){
       errflag =1;
        if(i!=  fkk.size()-1)
          cout<< fkk[i]<< ",";
            else cout<< fkk[i]<< "\n";

        }
        fkk.clear();
    if(changed.size() != 0)
    pf("*");
    for( i = 0 ;i < changed.size() ;i++) {
        errflag = 1;
      if(i!=  changed.size()-1)
        cout<< changed[i]<< ",";
        else cout<< changed[i]<< "\n";

    }
if(errflag == 0){
    pf("No changes\n");
}



    pf("\n");
    changed.clear();
    mp.clear();

  }
return 0 ;}