|  |  | @ -14,7 +14,6 @@ def crack(max_depth): | 
			
		
	
		
		
			
				
					
					|  |  |  |     tree = {"": 0} |  |  |  |     tree = {"": 0} | 
			
		
	
		
		
			
				
					
					|  |  |  |     while tree: |  |  |  |     while tree: | 
			
		
	
		
		
			
				
					
					|  |  |  |         curr = [key for key, val in sorted(tree.items(), key = lambda ele: ele[1])][-1] |  |  |  |         curr = [key for key, val in sorted(tree.items(), key = lambda ele: ele[1])][-1] | 
			
		
	
		
		
			
				
					
					|  |  |  |         print(curr) |  |  |  |  | 
			
		
	
		
		
			
				
					
					|  |  |  |         if len(curr) == max_depth: |  |  |  |         if len(curr) == max_depth: | 
			
		
	
		
		
			
				
					
					|  |  |  |             return curr |  |  |  |             return curr | 
			
		
	
		
		
			
				
					
					|  |  |  |         del tree[curr] |  |  |  |         del tree[curr] | 
			
		
	
	
		
		
			
				
					|  |  | @ -35,4 +34,4 @@ words = open(os.path.dirname(__file__)+"/words.txt", "r").read() | 
			
		
	
		
		
			
				
					
					|  |  |  | import vig |  |  |  | import vig | 
			
		
	
		
		
			
				
					
					|  |  |  | import re |  |  |  | import re | 
			
		
	
		
		
			
				
					
					|  |  |  | 
 |  |  |  | 
 | 
			
		
	
		
		
			
				
					
					|  |  |  | crack(args.keylen) |  |  |  | print(crack(args.keylen)) | 
			
				
				
			
		
	
		
		
	
	
		
		
			
				
					|  |  | 
 |