Python development "article xxx" __ Fibonacci series------Greatest common divisor

Source: Internet
Author: User
Tags for in range greatest common divisor

# # #菲波那切数列n = int (input (' Please enter the month you want to know!! >>   '= 1= 1= 2 for in range (4,n+1):    = J    = m    = i + j    print(' the number of rabbits in the '%s ' month is %s:'% (k,m))
# # #最大公约数
p = Int (input ('Please enter the first integer:')) Q= Int (Input ('Please enter the first integer:')) whileTrue:ifp = = 0 andQ! =0:Print('greatest Common divisor is%s'%(q)) Break elifP! = 0 andQ = =0:Print('greatest Common divisor is%s'%(p)) Break Else: ifp >Q:r= p%Qifr = =0:Print('greatest Common divisor is%s'%(q)) Break Else: P=q q=RContinue Else: R= q%Pifr = =0:Print('greatest Common divisor is%s'%(p)) Break Else: Q=P P=RContinue

Python development "article xxx" __ Fibonacci series------Greatest common divisor

Related Article

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.