# -*- coding: cp1250 -*-
"""
Ta programček je malenkost predelana verzija rešitve od
Antonyja Phillipsa in Dr Stuarta Mitcehlla, ki je dostopna na naslovu:
http://www.coin-or.org/PuLP/CaseStudies/a_sudoku_problem.html

Avtorji:
Jasna Urbančič, Ana Reberc, Uroš Hehić in David Gajser
"""

import sys

# Import PuLP modeler functions
from pulp import *

# A list of strings from "1" to "9" is created
Sequence = ["1", "2", "3", "4", "5", "6", "7", "8", "9"]

# The Vals, Rows and Cols sequences all follow this form
Vals = Sequence
Rows = Sequence
Cols = Sequence

# The boxes list is created, with the row and column index of each square in each box
Boxes =[]
for i in range(3):
    for j in range(3):
        Boxes += [[(Rows[3*i+k],Cols[3*j+l]) for k in range(3) for l in range(3)]]

# The prob variable is created to contain the problem data        
prob = LpProblem("Sudoku Problem",LpMinimize)

# The problem variables are created
choices = LpVariable.dicts("Choice",(Vals,Rows,Cols),0,1,LpInteger)

# The arbitrary objective function is added
prob += 0, "Arbitrary Objective Function"

# A constraint ensuring that only one value can be in each square is created
for r in Rows:
    for c in Cols:
        prob += lpSum([choices[v][r][c] for v in Vals]) == 1, ""

# The row, column and box constraints are added for each value
for v in Vals:
    for r in Rows:
        prob += lpSum([choices[v][r][c] for c in Cols]) == 1,""
        
    for c in Cols:
        prob += lpSum([choices[v][r][c] for r in Rows]) == 1,""

    for b in Boxes:
        prob += lpSum([choices[v][r][c] for (r,c) in b]) == 1,""
                        
# The starting numbers are entered as constraints
#
print("Za vsako vrstico vnesi 9 cifer, kot so zapisana v zacetni tabeli sudokuja. Za prazna polja vpisi 0.")
print("Vnesi vrstice:")
for q in range(9):
    vrstica = sys.stdin.readline()
    for p in range(9):
        znak = vrstica[p]
        if znak != '0':
            #print(znak)
            prob += choices[znak][str(q+1)][str(p+1)] == 1, ""
        #print("Dela!")
#

# The problem data is written to an .lp file
prob.writeLP("Sudoku.lp")

# The problem is solved using PuLP's choice of Solver
prob.solve()

# The status of the solution is printed to the screen
print "Status:", LpStatus[prob.status]

# A file called sudokuout.txt is created/overwritten for writing to
sudokuout = open('sudoku.txt','w')

# The solution is written to the sudokuout.txt file 
for r in Rows:
    if r == "1" or r == "4" or r == "7":
                    sudokuout.write("+-------+-------+-------+\n")
    for c in Cols:
        for v in Vals:
            if value(choices[v][r][c])==1:
                               
                if c == "1" or c == "4" or c =="7":
                    sudokuout.write("| ")
                    
                sudokuout.write(v + " ")
                
                if c == "9":
                    sudokuout.write("|\n")
sudokuout.write("+-------+-------+-------+")                    
sudokuout.close()

# The location of the solution is give to the user
print "Solution Written to sudoku.txt"