Linux premium180.web-hosting.com 4.18.0-553.54.1.lve.el8.x86_64 #1 SMP Wed Jun 4 13:01:13 UTC 2025 x86_64
LiteSpeed
: 162.0.209.168 | : 216.73.216.187
Cant Read [ /etc/named.conf ]
8.3.30
nortrmdp
www.github.com/MadExploits
Terminal
AUTO ROOT
Adminer
Backdoor Destroyer
Linux Exploit
Lock Shell
Lock File
Create User
CREATE RDP
PHP Mailer
BACKCONNECT
UNLOCK SHELL
HASH IDENTIFIER
CPANEL RESET
CREATE WP USER
BLACK DEFEND!
README
+ Create Folder
+ Create File
/
lib64 /
python2.7 /
Demo /
scripts /
[ HOME SHELL ]
Name
Size
Permission
Action
README
1009
B
-rw-r--r--
beer.py
458
B
-rwxr-xr-x
beer.pyc
703
B
-rw-r--r--
beer.pyo
703
B
-rw-r--r--
eqfix.py
6.16
KB
-rwxr-xr-x
eqfix.pyc
4.53
KB
-rw-r--r--
eqfix.pyo
4.53
KB
-rw-r--r--
fact.py
1.11
KB
-rwxr-xr-x
fact.pyc
1.14
KB
-rw-r--r--
fact.pyo
1.14
KB
-rw-r--r--
find-uname.py
1.18
KB
-rwxr-xr-x
find-uname.pyc
1.47
KB
-rw-r--r--
find-uname.pyo
1.47
KB
-rw-r--r--
from.py
873
B
-rwxr-xr-x
from.pyc
751
B
-rw-r--r--
from.pyo
751
B
-rw-r--r--
lpwatch.py
2.77
KB
-rwxr-xr-x
lpwatch.pyc
2.54
KB
-rw-r--r--
lpwatch.pyo
2.54
KB
-rw-r--r--
makedir.py
509
B
-rwxr-xr-x
makedir.pyc
732
B
-rw-r--r--
makedir.pyo
732
B
-rw-r--r--
markov.py
3.5
KB
-rwxr-xr-x
markov.pyc
3.93
KB
-rw-r--r--
markov.pyo
3.93
KB
-rw-r--r--
mboxconvert.py
3.11
KB
-rwxr-xr-x
mboxconvert.pyc
3.18
KB
-rw-r--r--
mboxconvert.pyo
3.18
KB
-rw-r--r--
morse.py
4.21
KB
-rwxr-xr-x
morse.pyc
4.33
KB
-rw-r--r--
morse.pyo
4.33
KB
-rw-r--r--
pi.py
887
B
-rwxr-xr-x
pi.pyc
921
B
-rw-r--r--
pi.pyo
921
B
-rw-r--r--
pp.py
3.72
KB
-rwxr-xr-x
pp.pyc
2.28
KB
-rw-r--r--
pp.pyo
2.28
KB
-rw-r--r--
primes.py
602
B
-rwxr-xr-x
primes.pyc
921
B
-rw-r--r--
primes.pyo
921
B
-rw-r--r--
queens.py
2.19
KB
-rwxr-xr-x
queens.pyc
2.95
KB
-rw-r--r--
queens.pyo
2.95
KB
-rw-r--r--
script.py
961
B
-rwxr-xr-x
script.pyc
1.21
KB
-rw-r--r--
script.pyo
1.21
KB
-rw-r--r--
unbirthday.py
3.07
KB
-rwxr-xr-x
unbirthday.pyc
2.93
KB
-rw-r--r--
unbirthday.pyo
2.93
KB
-rw-r--r--
update.py
2.68
KB
-rwxr-xr-x
update.pyc
2.69
KB
-rw-r--r--
update.pyo
2.69
KB
-rw-r--r--
Delete
Unzip
Zip
${this.title}
Close
Code Editor : queens.py
#! /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()
Close
