See also gcd (HDU 2504)

Source: Internet
Author: User

This question is really watery, but I have been connected to the wrong one. Please watch yourself !!!

I wrote the code to the east and forgot to go to the West. I had to eat the word "seriously" again, making a face burst.

# Include <iostream> using namespace STD; int gcd (int A, int B) {int t; while (B) {T = A; A = B; B = T % B;} return a;} int main () {int t; CIN> T; while (t --) {long A, B; cin> A> B; long c = 2 * B; while (gcd (a, c )! = B) {c = B + C ;}cout <C <Endl ;}}

This is the question code. I hope I will not commit it again. Even the non-recursive errors of GCD are written hundreds of times.

See also gcd (HDU 2504)

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.