2020 优必选笔试题——两个正整数的最大公约数

#include

using namespace std;

long long gcd(long long a, long long b) {
   long long max, min;
   max = a > b ? a : b;
   min = a > b ? b : a;
   if (max % min == 0) {
      return min;
   }
   else {
      return gcd(min, max % min);
   }
}

int main()
{
   long long a, b;
   cin >> a >> b;
   if (a == 0 || b == 0) {
      cout << "No result" << endl;
      return 0;
   }
   if (a == b) {
      cout << "The result is " << a << endl;
      return 0;
   }
   else {
      long long result = gcd(a, b);
      if (result == 0) {
         cout << "No result" << endl;
      }
      else {
         cout << "The result is " << result << endl;
      }
   }
   return 0;
}

 

你可能感兴趣的:(秋招笔试题)