Cylul007 Webshell
Server :
Linux ip-148-66-134-25.ip.secureserver.net 3.10.0-1160.119.1.el7.tuxcare.els10.x86_64 #1 SMP Fri Oct 11 21:40:41 UTC 2024 x86_64
php :
8.0.30
on
cgi-fcgi
Time
25 Nov 2024 22:46:17
Current Directory :
/
lib64
/
python2.7
/
Demo
/
scripts
/
Upload File :
Mass Deface
Home
Bypass Passwd
Current File : //lib64/python2.7/Demo/scripts/fact.py
#! /usr/bin/env python # Factorize numbers. # The algorithm is not efficient, but easy to understand. # If there are large factors, it will take forever to find them, # because we try all odd numbers between 3 and sqrt(n)... import sys from math import sqrt def fact(n): if n < 1: raise ValueError('fact() argument should be >= 1') if n == 1: return [] # special case res = [] # Treat even factors special, so we can use i += 2 later while n % 2 == 0: res.append(2) n //= 2 # Try odd numbers up to sqrt(n) limit = sqrt(n+1) i = 3 while i <= limit: if n % i == 0: res.append(i) n //= i limit = sqrt(n+1) else: i += 2 if n != 1: res.append(n) return res def main(): if len(sys.argv) > 1: source = sys.argv[1:] else: source = iter(raw_input, '') for arg in source: try: n = int(arg) except ValueError: print arg, 'is not an integer' else: print n, fact(n) if __name__ == "__main__": main()
./LuLlaby007 ♥ Tata Cantik - Copyright 2k18