Gecko [ goons4good.org ]

Linux server.edchosting.com 4.18.0-553.79.1.lve.el7h.x86_64 #1 SMP Wed Oct 15 16:34:46 UTC 2025 x86_64
LiteSpeed
Server IP : 75.98.162.185 & Your IP : 216.73.216.163
Domains : Cant Read [ /etc/named.conf ]
User : goons4good

Name	Size	Permission	Date
README	1009 B	-rw-r--r--	2013-05-11 23:32
beer.py	459 B	-rwxr-xr-x	2013-05-11 23:32
beer.pyc	703 B	-rw-r--r--	2025-11-12 09:25
beer.pyo	703 B	-rw-r--r--	2025-11-12 09:25
eqfix.py	6.16 KB	-rwxr-xr-x	2013-05-11 23:32
eqfix.pyc	4.52 KB	-rw-r--r--	2025-11-12 09:25
eqfix.pyo	4.52 KB	-rw-r--r--	2025-11-12 09:25
fact.py	1.11 KB	-rwxr-xr-x	2013-05-11 23:32
fact.pyc	1.14 KB	-rw-r--r--	2025-11-12 09:25
fact.pyo	1.14 KB	-rw-r--r--	2025-11-12 09:25
find-uname.py	1.18 KB	-rwxr-xr-x	2025-11-12 09:24
find-uname.pyc	1.47 KB	-rw-r--r--	2025-11-12 09:25
find-uname.pyo	1.47 KB	-rw-r--r--	2025-11-12 09:25
from.py	874 B	-rwxr-xr-x	2013-05-11 23:32
from.pyc	749 B	-rw-r--r--	2025-11-12 09:25
from.pyo	749 B	-rw-r--r--	2025-11-12 09:25
lpwatch.py	2.77 KB	-rwxr-xr-x	2013-05-11 23:32
lpwatch.pyc	2.54 KB	-rw-r--r--	2025-11-12 09:25
lpwatch.pyo	2.54 KB	-rw-r--r--	2025-11-12 09:25
makedir.py	510 B	-rwxr-xr-x	2013-05-11 23:32
makedir.pyc	732 B	-rw-r--r--	2025-11-12 09:25
makedir.pyo	732 B	-rw-r--r--	2025-11-12 09:25
markov.py	3.51 KB	-rwxr-xr-x	2013-05-11 23:32
markov.pyc	3.93 KB	-rw-r--r--	2025-11-12 09:25
markov.pyo	3.93 KB	-rw-r--r--	2025-11-12 09:25
mboxconvert.py	3.11 KB	-rwxr-xr-x	2013-05-11 23:32
mboxconvert.pyc	3.17 KB	-rw-r--r--	2025-11-12 09:25
mboxconvert.pyo	3.17 KB	-rw-r--r--	2025-11-12 09:25
morse.py	4.21 KB	-rwxr-xr-x	2013-05-11 23:32
morse.pyc	4.33 KB	-rw-r--r--	2025-11-12 09:25
morse.pyo	4.33 KB	-rw-r--r--	2025-11-12 09:25
newslist.doc	2.36 KB	-rwxr-xr-x	2013-05-11 23:32
newslist.py	11.17 KB	-rwxr-xr-x	2013-05-11 23:32
newslist.pyc	7.55 KB	-rw-r--r--	2025-11-12 09:25
newslist.pyo	7.55 KB	-rw-r--r--	2025-11-12 09:25
pi.py	888 B	-rwxr-xr-x	2013-05-11 23:32
pi.pyc	921 B	-rw-r--r--	2025-11-12 09:25
pi.pyo	921 B	-rw-r--r--	2025-11-12 09:25
pp.py	3.73 KB	-rwxr-xr-x	2013-05-11 23:32
pp.pyc	2.28 KB	-rw-r--r--	2025-11-12 09:25
pp.pyo	2.28 KB	-rw-r--r--	2025-11-12 09:25
primes.py	603 B	-rwxr-xr-x	2013-05-11 23:32
primes.pyc	921 B	-rw-r--r--	2025-11-12 09:25
primes.pyo	921 B	-rw-r--r--	2025-11-12 09:25
queens.py	2.19 KB	-rwxr-xr-x	2013-05-11 23:32
queens.pyc	2.95 KB	-rw-r--r--	2025-11-12 09:25
queens.pyo	2.95 KB	-rw-r--r--	2025-11-12 09:25
script.py	962 B	-rwxr-xr-x	2013-05-11 23:32
script.pyc	1.21 KB	-rw-r--r--	2025-11-12 09:25
script.pyo	1.21 KB	-rw-r--r--	2025-11-12 09:25
unbirthday.py	3.07 KB	-rwxr-xr-x	2013-05-11 23:32
unbirthday.pyc	2.93 KB	-rw-r--r--	2025-11-12 09:25
unbirthday.pyo	2.93 KB	-rw-r--r--	2025-11-12 09:25
update.py	2.69 KB	-rwxr-xr-x	2013-05-11 23:32
update.pyc	2.69 KB	-rw-r--r--	2025-11-12 09:25
update.pyo	2.69 KB	-rw-r--r--	2025-11-12 09:25

Rename

#! /usr/bin/env python

"""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()