Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • Home
  • SEARCH
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 8709103
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 13, 20262026-06-13T04:17:15+00:00 2026-06-13T04:17:15+00:00

m = int(input(First number (0 to stop): )) n = int(input(Second number: )) def

  • 0
m = int(input("First number (0 to stop): "))
n = int(input("Second number: "))

def gcd(a, b):
   while b != 0:
        c = a % b
        a = b
        b = c
        if b == 0:
            break
   return a

print ("The greatest common divisor of", n,"and", m, "is", abs(gcd(m,n)))

How do I break out of this while loop, when m is equal to 0.

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-06-13T04:17:16+00:00Added an answer on June 13, 2026 at 4:17 am

    You probably want an outer loop, judging from your input hint of (0 to stop):

    def gcd(a, b):
       while b != 0:
            c = a % b
            a, b = b, c  # tuple assignment FTW!
            if b == 0:
                break
       return a
    
    while True:
        m = int(input("First number (0 to stop): "))
        if m == 0:
            break
        n = int(input("Second number: "))
        print("The greatest common divisor of {0} and {1} is {2}".format(n, m, abs(gcd(m, n))))
    
    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

Here is two variants. First: int n = 42; int* some_function(int* input) { int*
public static string RatingCalculator(int input) { if (input < 10) { return string.Empty; }
.MODEL SMALL .STACK 64 .DATA MSGA DB 13,10,Input first number: ,$ MSGB DB 13,10,Input
.MODEL SMALL .STACK 1000 .DATA MSGA DB 13,10,Input first number: ,$ MSGB DB 13,10,Input
for the Given below code after int Input Value of 46348 i am getting
main.c (with all the headers like stdio, stdlib, etc): int main() { int input;
If I have the following Java code: int[][] readAPuzzle() { Scanner input = new
int x; scanf(%d,&x); printf(%d,x); Input: . (just a period) Output: 4096 Why does it
public static boolean palindrome(String input, int i, int j) { if (i >= j)
Im trying to create a method that take 2 int array as the input

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.