python的模块代码调用

关注

原创最新推荐文章于 2026-07-13 14:52:22 发布 461 阅读 AI 写同款· GEO 优化 ›

如何使用自定义模块调用Python代码？然后，我们可以通过"模块名.函数名"的方式调用模块中的函数，并传递相应的参数。接下来，我们使用"模块名.变量名"的方式访问模块中的变量，并打印出来。然后，在主程序中使用"import"语句导入自定义模块，并通过"模块名.函数名"的方式调用函数，以及通过"模块名.变量名"的方式访问变量。除了上述的"import"语句之外，还有其他一些导入模块的方式，例如使用"from 模块名 import 函数名"的方式导入指定的函数，或者使用"from 模块名 import *"的方式导入模块中的所有函数和变量。阅读详情

一、模块GCDFunction.py,用来求两个数的最大公约数

def  gcd(n1,n2):
     gcd=1
     k=2

     while k<=n1 and k<=n2:
            if n1%k==0 and n2%k==0:
                gcd=k
            k+=1

     return gcd


print "Finishing calculating greatest common divisor"

二、下面，运用模块GCDFunction.py，实现功能：输入两个整数，求它们的最大公约数

1. 方法1：从模块GCDFunction.py导入函数gcd

from GCDFunction import gcd # Import the module

# Prompt the user to enter two integers
n1 = eval(input("Enter the first integer: "))
n2 = eval(input("Enter the second integer: "))

print("The greatest common divisor for", n1,
    "and", n2, "is", gcd(n1, n2))

结果为：

Finishing calculating greatest common divisor
enter the first number: 45
enter the second number: 75
the divisor for 45 and 75 is 15

2. 方法2：直接导入模块GCDFunction.py

import GCDFunction
n1 = eval(raw_input("enter the first number: "))
n2 = eval(raw_input("enter the second number: "))
n1n2gcd = GCDFunction.gcd(n1,n2)
print "the divisor for %i and %i is %i" %(n1,n2,n1n2gcd)

结果为：

Finishing calculating greatest common divisor
enter the first number: 45
enter the second number: 75
the divisor for 45 and 75 is 15

三、下面，运用模块GCDFunction.py，实现功能：输入两个整数，求它们的最大公约数，循环做3次

1. 方法1：从模块GCDFunction.py导入函数gcd

from  GCDFunction  import gcd
for i in range(3):
    n1 = eval(raw_input("enter the first number: "))
    n2 = eval(raw_input("enter the second number: "))
    print "the divisor for %i and %i is %i" %(n1,n2,gcd(n1,n2))
    print

结果为：

Finishing calculating greatest common divisor
enter the first number: 15
enter the second number: 75
the divisor for 15 and 75 is 15

enter the first number: 16
enter the second number: 48
the divisor for 16 and 48 is 16

enter the first number: 17
enter the second number: 51
the divisor for 17 and 51 is 17

2. 方法2：直接导入模块GCDFunction.py

import GCDFunction
for i in range(3):
    n1 = eval(raw_input("enter the first number: "))
    n2 = eval(raw_input("enter the second number: "))
    n1n2gcd = GCDFunction.gcd(n1,n2)
    print "the divisor for %i and %i is %i" %(n1,n2,n1n2gcd)
    print

结果为：

Finishing calculating greatest common divisor
enter the first number: 15
enter the second number: 75
the divisor for 15 and 75 is 15

enter the first number: 16
enter the second number: 48
the divisor for 16 and 48 is 16

enter the first number: 17
enter the second number: 51
the divisor for 17 and 51 is 17