CCF-CSP 202212-3 JPEG 解码

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
double pi = 3.1415926535;

double a[9][9] = {0}, m[9][9] = {0}, ans[9][9] = {0};

int roundf(double n) { //四舍五入
	if (n > 0) {
		if (n - int(n) >= 0.5)
			return int(n) + 1;
		else
			return int(n);
	}
	if (-n - int(-n) >= 0.5)
		return -(int(-n) + 1);
	else
		return -int(-n);
}

int main() {
	for (int i = 1; i <= 8; i++)
		for (int j = 1; j <= 8; j++)
			cin >> a[i][j];
	int n = 0;
	cin >> n; //扫描数据的个数
	int task = 0;
	cin >> task; //任务类型
	int line = 1;//第几条斜线
	while (n > 0) {
		int number = (line <= 8 ) ? line : 16 - line ; //斜线上数字个数

		for (int i = 1; (i <= number) && (n > 0) ; i++) {
			if (number % 2 == 0) {
				if (line <= 8)
					cin >> m[i][line - i + 1];
				else
					cin >> m[line - 8 + i][9 - i];
				n--;

			} else {
				if (line <= 8)
					cin >> m[line - i + 1][i];
				else
					cin >> m[9 - i][line - 8 + i];
				n--;
			}
		}
		line++;
	}
	if (task == 0) { //输出填充结果
		for (int i = 1; i <= 8; i++) {
			for (int j = 1; j <= 8; j++)
				cout << m[i][j] << " ";
			cout << endl;
		}
		return 0;
	}

	for (int i = 1; i <= 8; i++) {
		for (int j = 1; j <= 8; j++) {
			if (task == 0)
				cout << m[i][j] << " ";
			if (task == 1 || task == 2) {
				m[i][j] *= a[i][j];
				if (task == 1)
					cout << m[i][j] << " ";
			}
		}
		if (task == 0 || task == 1)
			cout << endl;
	}
	if (task == 1 || task == 0)
		return 0;

	for (int i = 1; i <= 8; i++) {
		for (int j = 1; j <= 8; j++) {
			double temp = 0;
			for (int u = 1; u <= 8; u++) {
				double au = (u == 1) ? sqrt(0.5) : 1.0;
				for (int v = 1; v <= 8; v++) {
					double av = (v == 1) ? sqrt(0.5) : 1.0;
					temp += av * au * m[u][v] * cos(( pi / 8.0) * (i - 1 / 2.0) * (u - 1)) * cos(( pi / 8.0) * (j - 1 / 2.0) * (v - 1));
				}
			}
			ans[i][j] =  temp / 4.0;
				ans[i][j] = roundf(ans[i][j] + 128);
				if (ans[i][j] > 255)
					ans[i][j] = 255;
				else if (ans[i][j] < 0)
					ans[i][j] = 0;
			cout << ans[i][j] << " ";
		}
		cout << endl;
	}
	return 0;

}