topcoder SRM 610 DIV2 DivideByZero

    int CountNumbers(vector <int> numbers) {
        set<int> ss(numbers.begin(),numbers.end());
        bool flag = true;
        while(flag){
            flag = false;
            for(int i = 0 ; i < numbers.size(); ++ i ){
                for(int j = 0 ; j < numbers.size(); ++ j ){
                    if(numbers[i] > numbers[j] && ss.find(numbers[i]/numbers[j])==ss.end()) {
                        ss.insert(numbers[i]/numbers[j]);
                        numbers.push_back(numbers[i]/numbers[j]);
                        flag = true;
                    }
                }
            }
        }
        return ss.size();
    }