Python 14
[Python 100] Python 100
90,90=2*3*3*5
nk
(1)n
(2)nknkknk,n,
(3)nkk+1k,
(Python 2.0+)
#!/usr/bin/python
# -*- coding: UTF-8 -*-
def reduceNum(n):
print '{} = '.format(n),
if not isinstance(n, int) or n <= 0 :
print ' !'
exit(0)
elif n in [1] :
print '{}'.format(n)
while n not in [1] : #
for index in xrange(2, n + 1) :
if n % index == 0:
n /= index # n n/index
if n == 1:
print index
else : # index
print '{} *'.format(index),
break
reduceNum(90)
reduceNum(100)
(Python 3.0+)
#!/usr/bin/python3
def reduceNum(n):
print ('{} = '.format(n), end=" ")
if not isinstance(n, int) or n <= 0 :
print (' !')
exit(0)
elif n in [1] :
print ('{}'.format(n))
while n not in [1] : #
for index in range(2, n + 1) :
if n % index == 0:
n //= index # n n//index
if n == 1:
print (index )
else : # index
print ('{} *'.format(index), end=" ")
break
reduceNum(90)
reduceNum(100)
90 = 2 * 3 * 3 * 5 100 = 2 * 2 * 5 * 5
[Python 100] Python 100
102***[email protected]
Python3
#!/usr/bin/python3 x = int(input("1 0\n")); while(x): n = int(input("")); print ("%d = " %n , end = ''); while n not in [1]: for index in range(2, n+1): if n % index == 0: n = int(n/index); if n == 1: print("%d " %index , end = ''); else: print("%d * " %index , end = '') break; print(); x = int(input("1 0\n"));102***[email protected]
JohnLee
372***[email protected]
Python3
#!/usr/bin/python3 def prime(n): l = [] while n > 1: for i in range(2, n + 1): if n % i == 0: n = int(n / i) l.append(i) break return l s = input(":") if s.isdigit() and int(s) > 0: print(s, "=", "*".join([str(x) for x in prime(int(s))])) else: print("")JohnLee
372***[email protected]
Chivalry
825***[email protected]
#!/usr/bin/python # -*- coding: UTF-8 -*- input = int(raw_input("")) temp = [] while input!=1: for i in range(2,input+1): if input%i == 0: temp.append(i) input = input/i break print tempChivalry
825***[email protected]
Eric
382***[email protected]
#!/usr/bin/python # -*- coding: UTF-8 -*- import math l=[] def resolve(num): do=0 if num<1: return elif num==1: l.append(num) return for i in range(2,int(math.sqrt(num))+1): if num%i==0: do=1 l.append(i) num=num/i resolve(num) break if do==0: l.append(num) num=int(raw_input()) resolve(num) print l print "%d ="%num, for k in range(len(l)): if k!=len(l)-1: print "%d *"%l[k], else: print "%d" % l[k]Eric
382***[email protected]
Kunz
sun***[email protected]
:
#!/usr/bin/python # -*- coding: UTF-8 -*- n=int(raw_input('Please input a number:')) n1=n l=[] while n>1: for i in range(2,n+1): if n%i==0: n=n/i l.append(str(i)) break print '%d=' %n1 + '*'.join(l)Kunz
sun***[email protected]
Almighty
132***[email protected]
Python3
#!/usr/bin/env python3 from math import sqrt flag = 0 n = int(input("")) print("%d="%n,end="") m = int(sqrt(n)) + 1 for j in range(n): for i in range(2,m): if n%i == 0: if n == i: flag = 1 print("%d"%i,end='') else: print("%d*"%i,end='') n /= i break if flag == 1: breakAlmighty
132***[email protected]
Mark
104***[email protected]
Python3.6
#!/usr/bin/python3 x=input(":") if x.isdigit() and int(x)>0: x=int(x) t,i=1,2 print(x,end="=") while t>=0: if x%i==0: print(i,end="") x/=i t=x-i if x!=1: print("*",end="") while x%i and x!=1: i+=1 else: print("")Mark
104***[email protected]
CosmosHua
cos***[email protected]
Python3
def factor(n): fac = [] hf = n//2 while n>1: for i in range(2, hf+1): if n%i == 0: n //= i; fac.append(i); break return fac n = int(input("input a number: ")) print(n, "=", factor(n))CosmosHua
cos***[email protected]
kevinjin
314***[email protected]
#!/usr/bin/python # -*- coding: UTF-8 -*- num=raw_input(':\n') num=int(num) print '%d =' %num, i=2 while i<=num: if num%i==0: if num==i: print '%d' %i, break else: num=num/i print '%d *' %i, else: i+=1kevinjin
314***[email protected]
675***[email protected]
Python 3.x
import math def isprime(num): flag=1 for i in range(2,int(math.sqrt(num))+1): if num%i==0: flag=0 break if flag: return True else: return False num=int(input('input a number:')) print(num,'=',end='') while(not isprime(int(num))): for i in range(2,int(num)): if num%i==0: print(i,'*',end='') num/=i break print(int(num))675***[email protected]
382***[email protected]
Python3
import math print("") n = int(input()) if n <= 0: print("") i=2 if n!=1: while i!=n: if n % i == 0: print(i) n = n // i else: i+=1 print(i) else: print(n)382***[email protected]
wuhangxiang
yef***[email protected]
#!/usr/bin/python # -*- coding: UTF-8 -*- n=2 def fenjie(num): global n while n<=num: if n==num: print n break elif n<num and num%n==0: print '%d*'%n, num/=n fenjie(num) break elif n<num and num%n!=0: n+=1 fenjie(num) break number=input("input a number:") print '%d='%number, fenjie(number)wuhangxiang
yef***[email protected]
Echo
csz***[email protected]
, python2.x python3.x
#!/usr/bin/python # -*- coding: UTF-8 -*- num = int(input('')) def fenjie(num): strf = '{}='.format(num) flag = True while flag: for i in range(2,num+1): if not num%i: if i==num: flag = False strf = strf + str(i) else: strf = strf + str(i) + '×' num = num//i break return strf print(fenjie(num))Echo
csz***[email protected]
173***[email protected]
Python3
#primeprime() def prime(): i=2 while 1: for j in range(2,i): if i%j==0: i+=1 break else: yield i i+=1 k=int(input("1 0\n")) while k: n=int(input('1')) print(str(n)+'=',end='') flag=1 while flag: for i in prime(): if not n%i: if i==n: flag=0 print(i) else: print(str(i)+'*',end='') n=n//i break print('\n') k=int(input("1 0\n"))173***[email protected]
173***[email protected]
Python3: f(x), x :
#isprimex10 def isprime(x): for i in range(2,x): if x%i==0: return 0 else: return 1 #f(x),x def f(x): while not isprime(x): for i in range(2,x): if x%i==0: x=x//i yield i break yield x k=int(input('1 0\n')) while k: n=int(input('num:')) print(str(n)+'=',end='') s='' for j in f(n): s+=str(j)+'*' print(s[:-1]) print() k=int(input('1 0\n'))173***[email protected]