题目链接
http://118.190.20.162/view.page?gpid=T158
代码
#include <bits/stdc++.h>
using namespace std;
const int SIZE = 1e3 + 10;
const double PI = acos(-1);
int n, t;
int quantization[8][8] = {
0 }, m[8][8] = {
0 };
void print() {
for (int i = 0; i < 8; i++) {
for (int j = 0; j < 8; j++) {
cout << m[i][j] << " ";
}
cout << endl;
}
}
void quantity() {
for (int i = 0; i < 8; i++) {
for (int j = 0; j < 8; j++) {
m[i][j] *= quantization[i][j];
}
}
}
void scan() {
if (n) {
int direction = 0,//0代表，1代表
i = 7, j = 0, //下一个坐标（以矩阵左下角为原点，这个是我一开始这么写的，后面懒得改了）
change = -1;//指定哪个k要变方向
for (int k = 0; k < n; k++) {
cin >> m[i][j];
if (i == 7
&& change != k) {
//没有指定就不↓或→移动
change = k + 1;//指定下一个才移动
direction = 0;
j++;//最顶端向右→移
}
else if (j == 0
&&i!=0 //避免原点的下一个输入出错
&& change != k) {
change = k + 1;
direction = 1;
i--;//最左端向下↓移
}
else if (i == 0
&&j!=1 //避免在(0,0)点向右移动后在(0,1)点继续向右移动
&& change != k) {
change = k + 1;//指定下一个才移动
direction = 1;
j++;//最底端向右→移
}
else if (j == 7&&i!=7 && change != k) {
change = k + 1;
direction = 0;
i--;//最右端向下↓移
}
else {
if (direction) {
i++;//↑→
j++;
}
else {
i--;//↓←
j--;
}
}
}
//转换为以矩阵左上角为原点
for (int i = 7; i >= 4; i--) {
for (int j = 0; j < 8; j++) {
int t = m[i][j];
m[i][j] = m[7 - i][j];
m[7 - i][j] = t;
}
}
}
}
double alpha(int x) {
if (x == 0) {
return sqrt(0.5);
}
return 1;
}
void reverseChange() {
double temp[8][8] = {
0 };
for (int i = 0; i < 8; i++) {
for (int j = 0; j < 8; j++) {
for (int u = 0; u < 8; u++) {
for (int v = 0; v < 8; v++) {
temp[i][j] += (0.25 * alpha(u) * alpha(v) * m[u][v] * cos(0.125 * PI * (i + 0.5) * u) * cos(0.125 * PI * (j + 0.5) * v));
}
}
}
}
//特别注意！！！m矩阵要算完才能改
for (int i = 0; i < 8; i++) {
for (int j = 0; j < 8; j++) {
m[i][j] = (int)(temp[i][j] + 128 + 0.5);//四舍五入
if (m[i][j] > 255) {
m[i][j] = 255;
}
else if (m[i][j] < 0) {
m[i][j] = 0;
}
}
}
}
int main()
{
for (int i = 0; i < 8; i++) {
for (int j = 0; j < 8; j++) {
cin >> quantization[i][j];
}
}
cin >> n >> t;
switch (t) {
case 1:
scan();
quantity();
break;
case 2:
scan();
quantity();
reverseChange();
break;
default:
scan();
break;
}
print();
return 0;
}
总结
建议还是用数组指定输入顺序来读入，这个输入的方式也是debug很多次才写对的。