Gecko [ www.corporacionhdm.com.pe ]

Linux premium71.web-hosting.com 4.18.0-513.11.1.lve.el8.x86_64 #1 SMP Thu Jan 18 16:21:02 UTC 2024 x86_64
LiteSpeed
Server IP : 198.187.29.8 & Your IP : 18.117.229.144
Domains : Cant Read [ /etc/named.conf ]
User : cleahvkv

Name	Size	Permission	Date
README	1009 B	-rw-r--r--	2020-04-19 21:13
beer.py	458 B	-rwxr-xr-x	2024-04-10 04:57
beer.pyc	703 B	-rw-r--r--	2024-04-10 04:58
beer.pyo	703 B	-rw-r--r--	2024-04-10 04:58
eqfix.py	6.16 KB	-rwxr-xr-x	2024-04-10 04:57
eqfix.pyc	4.53 KB	-rw-r--r--	2024-04-10 04:58
eqfix.pyo	4.53 KB	-rw-r--r--	2024-04-10 04:58
fact.py	1.11 KB	-rwxr-xr-x	2024-04-10 04:57
fact.pyc	1.14 KB	-rw-r--r--	2024-04-10 04:58
fact.pyo	1.14 KB	-rw-r--r--	2024-04-10 04:58
find-uname.py	1.18 KB	-rwxr-xr-x	2024-04-10 04:57
find-uname.pyc	1.47 KB	-rw-r--r--	2024-04-10 04:58
find-uname.pyo	1.47 KB	-rw-r--r--	2024-04-10 04:58
from.py	873 B	-rwxr-xr-x	2024-04-10 04:57
from.pyc	751 B	-rw-r--r--	2024-04-10 04:58
from.pyo	751 B	-rw-r--r--	2024-04-10 04:58
lpwatch.py	2.77 KB	-rwxr-xr-x	2024-04-10 04:57
lpwatch.pyc	2.54 KB	-rw-r--r--	2024-04-10 04:58
lpwatch.pyo	2.54 KB	-rw-r--r--	2024-04-10 04:58
makedir.py	509 B	-rwxr-xr-x	2024-04-10 04:57
makedir.pyc	732 B	-rw-r--r--	2024-04-10 04:58
makedir.pyo	732 B	-rw-r--r--	2024-04-10 04:58
markov.py	3.5 KB	-rwxr-xr-x	2024-04-10 04:57
markov.pyc	3.93 KB	-rw-r--r--	2024-04-10 04:58
markov.pyo	3.93 KB	-rw-r--r--	2024-04-10 04:58
mboxconvert.py	3.11 KB	-rwxr-xr-x	2024-04-10 04:57
mboxconvert.pyc	3.18 KB	-rw-r--r--	2024-04-10 04:58
mboxconvert.pyo	3.18 KB	-rw-r--r--	2024-04-10 04:58
morse.py	4.21 KB	-rwxr-xr-x	2024-04-10 04:57
morse.pyc	4.33 KB	-rw-r--r--	2024-04-10 04:58
morse.pyo	4.33 KB	-rw-r--r--	2024-04-10 04:58
pi.py	887 B	-rwxr-xr-x	2024-04-10 04:57
pi.pyc	921 B	-rw-r--r--	2024-04-10 04:58
pi.pyo	921 B	-rw-r--r--	2024-04-10 04:58
pp.py	3.72 KB	-rwxr-xr-x	2024-04-10 04:57
pp.pyc	2.28 KB	-rw-r--r--	2024-04-10 04:58
pp.pyo	2.28 KB	-rw-r--r--	2024-04-10 04:58
primes.py	602 B	-rwxr-xr-x	2024-04-10 04:57
primes.pyc	921 B	-rw-r--r--	2024-04-10 04:58
primes.pyo	921 B	-rw-r--r--	2024-04-10 04:58
queens.py	2.19 KB	-rwxr-xr-x	2024-04-10 04:57
queens.pyc	2.95 KB	-rw-r--r--	2024-04-10 04:58
queens.pyo	2.95 KB	-rw-r--r--	2024-04-10 04:58
script.py	961 B	-rwxr-xr-x	2024-04-10 04:57
script.pyc	1.21 KB	-rw-r--r--	2024-04-10 04:58
script.pyo	1.21 KB	-rw-r--r--	2024-04-10 04:58
unbirthday.py	3.07 KB	-rwxr-xr-x	2024-04-10 04:57
unbirthday.pyc	2.93 KB	-rw-r--r--	2024-04-10 04:58
unbirthday.pyo	2.93 KB	-rw-r--r--	2024-04-10 04:58
update.py	2.68 KB	-rwxr-xr-x	2024-04-10 04:57
update.pyc	2.69 KB	-rw-r--r--	2024-04-10 04:58
update.pyo	2.69 KB	-rw-r--r--	2024-04-10 04:58

Rename

#! /usr/bin/python2.7

"""N queens problem.

The (well-known) problem is due to Niklaus Wirth.

This solution is inspired by Dijkstra (Structured Programming).  It is
a classic recursive backtracking approach.

"""

N = 8                                   # Default; command line overrides

class Queens:

def __init__(self, n=N):
        self.n = n
        self.reset()

def reset(self):
        n = self.n
        self.y = [None] * n             # Where is the queen in column x
        self.row = [0] * n              # Is row[y] safe?
        self.up = [0] * (2*n-1)         # Is upward diagonal[x-y] safe?
        self.down = [0] * (2*n-1)       # Is downward diagonal[x+y] safe?
        self.nfound = 0                 # Instrumentation

def solve(self, x=0):               # Recursive solver
        for y in range(self.n):
            if self.safe(x, y):
                self.place(x, y)
                if x+1 == self.n:
                    self.display()
                else:
                    self.solve(x+1)
                self.remove(x, y)

def safe(self, x, y):
        return not self.row[y] and not self.up[x-y] and not self.down[x+y]

def place(self, x, y):
        self.y[x] = y
        self.row[y] = 1
        self.up[x-y] = 1
        self.down[x+y] = 1

def remove(self, x, y):
        self.y[x] = None
        self.row[y] = 0
        self.up[x-y] = 0
        self.down[x+y] = 0

silent = 0                          # If true, count solutions only

def display(self):
        self.nfound = self.nfound + 1
        if self.silent:
            return
        print '+-' + '--'*self.n + '+'
        for y in range(self.n-1, -1, -1):
            print '|',
            for x in range(self.n):
                if self.y[x] == y:
                    print "Q",
                else:
                    print ".",
            print '|'
        print '+-' + '--'*self.n + '+'

def main():
    import sys
    silent = 0
    n = N
    if sys.argv[1:2] == ['-n']:
        silent = 1
        del sys.argv[1]
    if sys.argv[1:]:
        n = int(sys.argv[1])
    q = Queens(n)
    q.silent = silent
    q.solve()
    print "Found", q.nfound, "solutions."

if __name__ == "__main__":
    main()