Linux server1.dn-server.com 4.18.0-553.89.1.lve.el8.x86_64 #1 SMP Wed Dec 10 13:58:50 UTC 2025 x86_64
LiteSpeed
Server IP : 195.201.204.189 & Your IP : 216.73.216.198
Domains :
Cant Read [ /etc/named.conf ]
User : beriska1
Terminal
Auto Root
Create File
Create Folder
Localroot Suggester
Backdoor Destroyer
Readme
/
opt /
alt /
python27 /
lib64 /
python2.7 /
Demo /
scripts /
Delete
Unzip
Name
Size
Permission
Date
Action
README
1009
B
-rwxr-xr-x
2025-01-08 14:12
beer.py
468
B
-rwxr-xr-x
2025-01-08 14:12
eqfix.py
6.17
KB
-rwxr-xr-x
2025-01-08 14:12
fact.py
1.12
KB
-rwxr-xr-x
2025-01-08 14:12
find-uname.py
1.19
KB
-rwxr-xr-x
2025-01-08 14:12
from.py
883
B
-rwxr-xr-x
2025-01-08 14:12
lpwatch.py
2.78
KB
-rwxr-xr-x
2025-01-08 14:12
makedir.py
519
B
-rwxr-xr-x
2025-01-08 14:12
markov.py
3.51
KB
-rwxr-xr-x
2025-01-08 14:12
mboxconvert.py
3.12
KB
-rwxr-xr-x
2025-01-08 14:12
morse.py
4.22
KB
-rwxr-xr-x
2025-01-08 14:12
pi.py
897
B
-rwxr-xr-x
2025-01-08 14:12
pp.py
3.73
KB
-rwxr-xr-x
2025-01-08 14:12
primes.py
612
B
-rwxr-xr-x
2025-01-08 14:12
queens.py
2.2
KB
-rwxr-xr-x
2025-01-08 14:12
script.py
971
B
-rwxr-xr-x
2025-01-08 14:12
unbirthday.py
3.08
KB
-rwxr-xr-x
2025-01-08 14:12
update.py
2.69
KB
-rwxr-xr-x
2025-01-08 14:12
Save
Rename
#! /opt/alt/python27/bin/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()