View Code of Problem 22

#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;

int main(){
    char input[2][1000];
    char result[1000] = {0};
    while(cin >> input[0] >> input[1]){
        int k = 0;
        for(int i = 0; input[0][i] != 0; i++){
            for(int j = 0; input[1][j] != 0; j++){
                int breakFlag = 0;
                if(input[1][j] == input[0][i]){
                    for(int l = 0; result[l] != 0; l++){
                        if(result[l] == input[1][j]){
                            breakFlag = 1;
                            break;
                        }
                    }
                    if(breakFlag)
                        break;
                    result[k++] = input[1][j];
                    result[k] == 0;
                    input[1][j] = '#';
                    break;
                }
            }
        }
        sort(result, result+strlen(result));
        cout << result << endl;
        memset(input,0,sizeof(input));
        memset(result,0,sizeof(result));
    }
    return 0;
}