Codeforces Round #701 (Div. 2) D. Multiples and Power Differences(数学)

Multiples and Power Differences

---

题目链接

大致题意:

给出矩阵a,构造矩阵b,要求b[i][j]是a[i][j]的倍数且1<=b[i][j]<=1e6,相邻两个元素差值是k^4 (k>=1)

---

解题思路:

因为矩阵a的取值是1-16,lcm(1-6)=720720,使b数组初始全是720720,满足倍数的条件

差值是相邻元素,可以固定(i+j)%==0的点不变,它相邻的点加上a[i][j]^4,720720+16^4=786256,满足b[i][j]<=1e6

---

AC代码:

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(void)
{
	int n, m; cin >> n >> m;
	for (int i = 1; i <= n; ++i) {
		for (int j = 1; j <= m; ++j) {
			int x; cin >> x;
			if ((i + j) & 1)cout << 720720 + x * x * x * x << ' ';
			else cout << 720720 << ' ';
		}
		cout << endl;
	}
	return 0;
}