12 weeks (for the maximum number of books in multiple groups)

12 weeks (for the maximum number of books in multiple groups)

/*
* Copyright (c) 2014, computer College, Yantai University
* All rights reserved.
* File name: test. cpp
* Author: Wang Zhong
* Completion date: January 1, November 16, 2014
* Version No.: v1.0
*
* Problem description: calculate the maximum number of N groups;
* Input Description: Number of n groups, and number of each group;
* Program output: output the maximum common divisor in each group.

# Include

 
  
Using namespace std; int gcd (int x, int y); int main () {int a, B, g, n; cin> n; for (int I = 1; I <= n; ++ I) {cin> a> B; g = gcd (a, B); cout <"the maximum public approx. is:" <