zoukankan      html  css  js  c++  java
  • 百度在线笔试编程测试题(Python):整数分解成素数的积

    编程测试题:

    输入一个正整数将其分解成素数的乘积,输入格式连续输入m个数,然后将这m个数分别分解,如

    输入:

    2
    10
    20
    

    输出:

    2 5
    2 2 5

    Python code:

    def primes(n):
        primfac = []
        d = 2
        while d*d <= n:
            while (n % d) == 0:
                primfac.append(d)
                n //= d
            d += 1
        if n > 1:
           primfac.append(n)
        return primfac
    
    
    s = int(raw_input())
    i=0
    fac=[]
    N = []
    while i<s:
        N = N + [int(raw_input())]    
        i = i+1
    i=0
    while i<s:
        j=0
        fac = fac+[primes(N[i])]    
        for j in range(len(fac[i])):
            print fac[i][j],
        print 
        i=i+1
    

      

  • 相关阅读:
    10.28
    10.29
    11.05周四
    数据库增删改查
    11.03Tuesday
    11.10
    连接数据库
    10.30
    11.04周三
    10.27
  • 原文地址:https://www.cnblogs.com/huadongw/p/5954664.html
Copyright © 2011-2022 走看看