7.2总结

好久没刷题了，写了几个简单的模拟题和高精度题温习一下

P4924 [1007] 魔法少女小Scarlet - 洛谷 | 计算机科学教育新生态 (luogu.com.cn)

思路：

顺时针和逆时针是相反的，会了一个就能会另一个，花点时间就能看懂，根据题意我们可以知道要旋转的是以目标点中心的2r+1阶矩阵，矩阵最左边为x-r,最右边为x+r,最上面为y+r,最下面为y-r,将这个矩阵复制一次，方便之后对原来的矩阵进行修改

代码：

#define _CRT_SECURE_NO_WARNINGS 1
#include<bits/stdc++.h>
using namespace std;
int a[505][505];
int b[505][505];
int main()
{
	int n, m, s = 1;
	cin >> n >> m;
	for (int i = 1; i <= n; i++)
	{
		for (int j = 1; j <= n; j++)
		{
			a[i][j] = s++;
		}
	}
	int x, y, r, z;
	while (m--)
	{
		cin >> x >> y >> r >> z;
		for (int i = x - r; i <= x + r; i++)
		{
			for (int j = y - r; j <= y + r; j++)
			{
				b[i][j] = a[i][j];
			}
		}
		if (z == 0)
		{
			int x1 = x + r, y1 = y - r;
			for (int i = x - r; i <= x + r; i++)
			{
				for (int j = y - r; j <= y + r; j++)
				{
					a[i][j] = b[x1][y1];
					x1--;
				}
				x1 = x + r, y1++;
			}
		}
		if (z == 1)
		{
			int x1 = x - r, y1 = y + r;
			for (int i = x - r; i <= x + r; i++)
			{
				for (int j = y - r; j <= y + r; j++)
				{
					a[i][j] = b[x1][y1];
					x1++;
				}
				x1 = x - r, y1--;
			}
		}
	}

	for (int i = 1; i <= n; i++)
	{
		for (int j = 1; j <= n; j++)
		{
			cout << a[i][j] << " ";
		}
		cout << endl;
	}

	return 0;
}

加法高精度：

#define _CRT_SECURE_NO_WARNINGS 1
#include<bits/stdc++.h>
using namespace std;
char s1[505], s2[505];
int a[505], b[505], c[505];
int main()
{
	cin >> s1;
	cin >> s2;
	int la = strlen(s1);
	int lb = strlen(s2);
	for (int i = 0; i < la; i++)
	{
		a[la - i] = s1[i] - '0';
	}
	for (int i = 0; i < lb; i++)
	{
		b[lb - i] = s2[i] - '0';
	}
	int lc = max(la, lb) + 1;
	for (int i = 1; i <= lc; i++)
	{
		c[i] += a[i] + b[i];
		c[i + 1] = c[i]/10;
		c[i] %= 10;
	}
	if (c[lc] == 0 && lc > 0)lc--;
	for (int i = lc; i > 0; i--)
	{
		cout << c[i];
	}
	return 0;
}

乘法高精度：

#include <iostream>
#include <cstring>
using namespace std;

const int MAX_LEN = 2005;

char s1[MAX_LEN], s2[MAX_LEN];
int a[MAX_LEN], b[MAX_LEN], c[MAX_LEN * 2]; // c数组大小要足够存储乘积结果

int main() {
    cin >> s1 >> s2;
    int la = strlen(s1);
    int lb = strlen(s2);
    int lc = la + lb - 1; // 最大可能的乘积位数为 la + lb - 1

    // 将字符数组s1和s2中的字符转换为整数数组a和b
    for (int i = 0; i < la; ++i) {
        a[la - 1 - i] = s1[i] - '0';
    }
    for (int i = 0; i < lb; ++i) {
        b[lb - 1 - i] = s2[i] - '0';
    }

    // 计算乘积并处理进位
    for (int i = 0; i < la; ++i) {
        for (int j = 0; j < lb; ++j) {
            c[i + j] += a[i] * b[j];
            c[i + j + 1] += c[i + j] / 10;
            c[i + j] %= 10;
        }
    }

    // 找到最高有效位
    while (lc >= 0 && c[lc] == 0) {
        --lc;
    }

    // 输出结果
    if (lc < 0) {
        cout << "0";
    } else {
        for (int i = lc; i >= 0; --i) {
            cout << c[i];
        }
    }
    
    cout << endl;
    return 0;
}