1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
#include <string.h>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
bool comp(string a,string b){
    return a.length() < b.length();
}
bool solution(vector<string> phone_book) {
    bool answer = true;
    sort(phone_book.begin(),phone_book.end(),comp);
    for(int i=0;i<phone_book.size();i++)
        cout << phone_book[i]<< ' ';
    
    for(int i=0;i<phone_book.size()-1;i++){
        for(int j=i+1;j<phone_book.size();j++){
            string temp=phone_book[j].substr(0,phone_book[i].length());
            if(temp==phone_book[i])
                return false;
        }
    }
    return answer;
}