Initial commit

Author: lonhattan007

.gitignore

@@ -0,0 +1,7 @@
+# IDE
+.vscode/
+
+# Byte-compiled / optimized / DLL files
+__pycache__/
+*.py[cod]
+*.$py.class

README.md

@@ -0,0 +1,29 @@
+# Numbers Evaille
+
+## Description
+
+This folder contains files to solve the Numbers Evaille problem:
+
+Given a pack of cards with unique numbers and a required goal card from the pack. The cards are categorized into ranks. Find 4 cards of whose ranks differ from each other and the goal number card's rank, such that the sum of the 4 cards is equal to the goal card's number.
+
+## Folder structure:
+
+- _card.py_: Python file defining class Card
+- _deck.py_: Python file defining class Deck
+- _solution.py_: Python solution file
+- _input.txt_: Input file, currently only contains 107 first cards and their primary ranks
+- _README.md_: Instruction file
+
+## How to use
+
+- You need to install Python version 3.x on your machine, or have a python compiler in your IDE (Visual Studio, Pycharm,...).
+- In your terminal, move into this folder and run:
+    - Window: `python solution.py input.txt`
+    - Linux or Mac: `python3 solution.py input.txt`
+- Or you can run the program in your IDE, make sure to config `input.txt` as an argument.
+
+## Status
+
+- __The algorithm is not ready, currently the program just imports and prints cards' info.__
+- Solving for extra cards is currently unavailable.
+- The input file can only contain a rank per card. For cards with alternative ranks, you need to create a new input file.

card.py

@@ -0,0 +1,16 @@
+class Card():
+    """A card has a number and a rank"""
+    
+    def __init__(self, number, rank):
+        self.number = number
+        self.rank = rank
+
+    
+    def __init__(self, info: list):
+        self.number = int(info[0])
+        self.rank = int(info[-1])
+
+
+    def print(self):
+        print("Number:", self.number)
+        print("Rank:", self.rank)

deck.py

@@ -0,0 +1,79 @@
+from card import Card
+
+class Deck():
+    """A set of cards categorized by their ranks"""
+
+    def __init__(self):
+        self.ranks = []
+
+
+    def sorted_append(self, card: Card):
+        index = 0
+        flag = False
+        
+        if len(self.ranks) == 0:        
+            pass
+        else:
+            for rank in self.ranks:
+                if rank[0].rank == card.rank:
+                    rank.append(card)
+                    flag = True
+                    break
+                elif rank[0].rank < card.rank:
+                    index += 1
+                else:
+                    break
+        
+        if flag != True:
+            self.ranks.insert(index, [card])
+
+
+    def is_empty(self):
+        return len(self.ranks) == 0    
+
+
+    def print(self):
+        if self.is_empty():
+            print("Empty deck")
+        else:
+            for rank in self.ranks:
+                print("Rank", rank[0].rank)
+
+                for card in rank:
+                    print("Number:", card.number)
+                
+                print("_____________")
+
+    
+    def rank_of(self, number):
+        if self.is_empty():
+            return -1
+
+        result = 0
+        
+        for rank in self.ranks:
+            for card in rank:
+                if card.number == number:
+                    result = card.rank
+
+        return result 
+
+
+    def min_num(self):
+        if self.is_empty():
+            return -1
+
+        min_lst = [rank[0].number for rank in self.ranks]
+        rank_of_min_num = min_lst.index(min(min_lst))
+
+        return self.ranks[rank_of_min_num][0].number        
+        
+    
+    def max_num(self):
+        if self.is_empty():
+            return -1
+
+        max_lst = [rank[-1].number for rank in self.ranks]
+        rank_of_max_num = max_lst.index(max(max_lst))
+
+        return self.ranks[rank_of_max_num][-1].number        

input.txt

@@ -0,0 +1,107 @@
+001, 01
+002, 01
+003, 01
+004, 01
+005, 05
+006, 06
+007, 07
+008, 04
+009, 09
+010, 04
+011, 07
+012, 05
+013, 01
+014, 05
+015, 08
+016, 04
+017, 03
+018, 04
+019, 05
+020, 03
+021, 06
+022, 08
+023, 08
+024, 06
+025, 06
+026, 03
+027, 04
+028, 07
+029, 02
+030, 03
+031, 01
+032, 04
+033, 05
+034, 03
+035, 10
+036, 04
+037, 04
+038, 08
+039, 04
+040, 08
+041, 04
+042, 07
+043, 02
+044, 04
+045, 02
+046, 08
+047, 03
+048, 03
+049, 03
+050, 04
+051, 03
+052, 04
+053, 05
+054, 01
+055, 04
+056, 01
+057, 04
+058, 04
+059, 04
+060, 04
+061, 05
+062, 08
+063, 01
+064, 02
+065, 02
+066, 04
+067, 05
+068, 08
+069, 04
+070, 04
+071, 03
+072, 06
+073, 05
+074, 07
+075, 03
+076, 07
+077, 12
+078, 01
+079, 04
+080, 04
+081, 10
+082, 04
+083, 01
+084, 11
+085, 04
+086, 04
+087, 08
+088, 08
+089, 07
+090, 08
+091, 04
+092, 09
+093, 12
+094, 05
+095, 09
+096, 02
+097, 08
+098, 04
+099, 12
+100, 01
+101, 04
+102, 04
+103, 04
+104, 04
+105, 04
+106, 04
+107, 08

solution.py

@@ -0,0 +1,102 @@
+from sys import argv
+from card import Card
+from deck import Deck
+
+
+def import_card(string: str) -> Card:
+    return Card(string.split(', '))
+
+
+def import_deck(filename: str) -> Deck:
+    deck = Deck()
+    
+    with open(filename, "r") as open_file_obj:
+        for line in open_file_obj:
+            deck.sorted_append(import_card(line))
+
+    return deck
+
+
+def solve(deck: Deck, goal: int):
+    # """Solve the problem in Dynamic Programming style"""
+    
+    # """Check for exceptions"""
+    # if deck.is_empty():
+    #     raise Exception("Deck is empty")
+    
+    # if len(deck.ranks) < 5:
+    #     raise Exception("Not enough ranks")  
+
+    # if goal < deck.min_num() or goal > deck.max_num():
+    #     raise Exception("Goal number is out of deck range")
+
+    # """Step 1: List all possible combos"""
+    # """Might check for different ranks as well"""
+    # solutions = []
+
+    # # TODO
+    # candidate_lst = deck.ranks
+    # goal_rank = deck.rank_of(goal)
+
+    # for rank_ind in range (0, len(candidate_lst)):
+    #     if rank_ind[0].rank != goal_rank:
+    #         pass  
+    #     else:
+    #         candidate_lst.pop(rank_ind)
+    #         break
+
+    
+    
+    # """Step 2: Check if their ranks are not the same"""
+    # """Might be deleted later"""
+    # if len(solutions) != 0:
+    #     unqualified = []
+
+    #     for sol in solutions:            
+    #         if sol[0].rank != sol[1].rank and sol[1].rank != sol[2].rank and sol[2].rank != sol[3].rank and sol[3].rank != sol[1].rank:
+    #             pass
+    #         else:
+    #             unqualified.append(sol)
+
+    #     for sol in unqualified:
+    #         solutions.remove(sol)
+
+    return [] # solutions
+
+
+def main():
+    deck = import_deck(argv[1])
+    deck.print()
+
+    goal = int(input("Goal: "))
+
+    print("Rank of number", goal, "is:", deck.rank_of(goal))
+    print("Min number in the deck is:", deck.min_num())
+    print("Max number in the deck is:", deck.max_num())
+
+    solutions = solve(deck, goal)
+
+    """Print result"""
+    if len(solutions) == 0:
+        print("No solutions were found")
+    else:
+        no = 1
+        for sol in solutions:
+            print("Solution", no)
+            
+            for card in sol:
+                card.print()
+
+            print("_____________")            
+            
+            no += 1
+
+
+if __name__ == "__main__":
+    """Input: (1) list of cards, sorted in ascending order of card number
+              (2) the desired total number"""
+    """Output: list of solutions"""
+    
+    main()
+    
+