CodeChef RRMATRIX Strange Matrix

题意：将1-m*n个数字填入按行和列填入两个m*n的矩阵中，求两个矩阵中对应位置数值相同的个数。

链接：http://www.codechef.com/problems/RRMATRIX

思路：通过较小数据的打表可知，ans(m,n) = __gcd( m-1, n-1 ) + 1

注意点：注意gcd时m,n不能为1

以下为AC代码：

ID	Date/Time	User	Result	Time	Mem	Lang	Solution
6355910	3 min ago	luminous11		0.50	3.2M	C++14	View

#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <vector>
#include <deque>
#include <list>
#include <cctype>
#include <algorithm>
#include <climits>
#include <queue>
#include <stack>
#include <cmath>
#include <map>
#include <set>
#include <iomanip>
#include <cstdlib>
#include <ctime>
#define ll long long
#define ull unsigned long long
#define all(x) (x).begin(), (x).end()
#define clr(a, v) memset( a , v , sizeof(a) )
#define pb push_back
#define mp make_pair
#define read(f) freopen(f, "r", stdin)
#define write(f) freopen(f, "w", stdout)
using namespace std;
const double pi = acos(-1);

//Problem A

int main()
{
    ios::sync_with_stdio( false );
    ll t;
    cin >> t;
    while ( t -- ){
        ll m, n;
        cin >> m >> n;
        if ( m == 1 || n == 1 ){
            cout << m * n << endl;
            continue;
        }
        if ( m == n ){
            cout << m << endl;
            continue;
        }
        int ans = __gcd ( m - 1, n - 1 );
        if ( ans == m  )
            cout << ans << endl;
        else
            cout << ans + 1 << endl;
        //cout << m << ' ' << n << endl;
    }

    return 0;
}