def test_combination_with_duplicate_backtrack(self): c = Combinations() input = ['1', '1', '1', '4'] k = 2 res = c.combinations_with_duplicates_backtrack(input, k) print res
def test1(self): c = Combinations() input = ['1', '2', '3', '4'] k = 1 res = c.combinations_no_duplicates(input, k) print res
def test_combination_non_recursive(self): c = Combinations() input = ['1', '2', '3', '4'] k = 2 res = c.combination_non_recursive(input, k) print res
def test_duplicates_3(self): c = Combinations() input = ['1', '1', '1', '1'] k = 0 res = c.combinations_with_duplicates(input, k) print res
def main(): print Combinations(["a", "b", "ab", "abc"]).find_possible_combinations("aabcd") print Combinations(["a", "b", "ab", "abc"]).find_possible_combinations("aabc")
if __name__ == "__main__": view.clear() view.logo() url = get_URL() profile = {} if (url != ''): profile = fs.scraping(url) else: profile["name"] = get_name() get_information(profile) view.clear() view.show_info(profile) finish = False t = Combinations(profile) info = t.info op = menu('') while (not finish): if (op == '1'): wg(info, profile) message = 'Your wordlist is ready, the file is wordlist.txt' op = menu(message) elif (op == '2'): Validate(info) op = menu('') else: try: