1266C - Diverse Matrix

// Problem: C. Diverse Matrix
// Contest: Codeforces - Codeforces Global Round 6
// URL: https://codeforces.com/problemset/problem/1266/C
// Memory Limit: 256 MB
// Time Limit: 1000 ms
// 2022-03-03 18:20:40
// 
// Powered by CP Editor (https://cpeditor.org)

#include<bits/stdc++.h>
using namespace std;

#define rep(i,l,r) for(int i=(l);i<=(r);i++)
#define per(i,l,r) for(int i=(l);i>=(r);i--)
#define ll long long
#define pii pair<int, int>
#define mset(s,t) memset(s,t,sizeof(t))
#define mcpy(s,t) memcpy(s,t,sizeof(t))
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define mp make_pair

const ll mod = 1e9 + 7;

inline ll qmi (ll a, ll b) {
	ll ans = 1;
	while (b) {
		if (b & 1) ans = ans * a%mod;
		a = a * a %mod;
		b >>= 1;
	}
	return ans;
}
inline int read () {
	int x = 0, f = 0;
	char ch = getchar();
	while (!isdigit(ch)) f |= (ch=='-'),ch= getchar();
	while (isdigit(ch)) x = x * 10 + ch - '0', ch = getchar();
	return f?-x:x;
}
template<typename T> void print(T x) {
	if (x < 0) putchar('-'), x = -x;
	if (x >= 10) print(x/10);
	putchar(x % 10 + '0');
}
inline ll sub (ll a, ll b) {
	return ((a - b ) %mod + mod) %mod;
}
inline ll add (ll a, ll b) {
	return (a + b) %mod;
}
inline ll inv (ll a) {
	return qmi(a, mod - 2);
}
void solve() {
	int r, c;
	cin >> r >> c;
	if (r == c && c == 1) {
		puts("0");
		return;
	}
	if (r == 1) {
		for (int j = 1; j <= c; j ++)
			cout << j + 1 << " ";
		puts("");
		return;
	}
	else if (c == 1) {
		for (int i =1; i <= r; i ++)
			cout << i + 1 << endl;
		return;
	}
	for (int i = 1; i <= r; i ++) {
		for (int j = 1; j<= c; j ++)
			cout << i * (j + r) << " ";
		puts("");
	}
}
int main () {
    int t;
    t =1;
    //cin >> t;
    while (t --) solve();
    return 0;
}

我没有找到合适的角度思考

从(i, j)的角度想。
首先考虑特殊的案例
r =1 || c == 1
然后考虑一般化的
对于某一行我们可以
	gcd(i * (j + r), i * ((j+ 1) + r)....) = i * gcd(j + r, j + 1 + r, ...) = i
类似的可以证明其他列行