第六章数学_提高篇

最新推荐文章于 2024-09-09 23:37:48 发布

路哞哞

最新推荐文章于 2024-09-09 23:37:48 发布

阅读量142

点赞数

分类专栏：算法笔记文章标签： c++ 算法

本文链接：https://blog.csdn.net/qq_34696503/article/details/125989378

版权

算法笔记专栏收录该内容

28 篇文章 2 订阅

订阅专栏

这篇博客介绍了六个算法题目，包括计算N的阶乘、找出阶乘末尾的0数量、解决整除问题、矩阵的旋转、矩阵的幂运算以及C数组的翻转。每个问题都提供了详细的C++代码实现，展示了如何运用数学知识和算法技巧解决实际问题。

摘要由CSDN通过智能技术生成

1、N的阶乘

ACwing 3389

#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;

const int N = 1010;

int n;
vector<int> F[N];

vector<int> mul(vector<int> &A, int B) {
    vector<int> C;
    for (int i = 0, t = 0; i < A.size() || t; i++) {
        if (i < A.size()) t += A[i] * B;
        C.push_back(t % 10);
        t /= 10;
    }
    while (C.size() > 1 && !C.back()) C.pop_back();
    return C;
}

int main() {
    F[0] = {1};
    for (int i = 1; i <= 1000; i++) F[i] = mul(F[i - 1], i);
    while (cin >> n) {
        for (int i = F[n].size() - 1; i >= 0; i--)
            cout << F[n][i];
        cout << endl;
    }
    return 0;
}

2、阶乘的末尾0

ACwing 3507

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

int main() {
    int n;
    cin >> n;
    int res = 0;
    while (n / 5) res += n / 5, n /= 5;
    cout << res << endl;
    return 0;
}

3、整除问题

ACwing 3484

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

vector<vector<int>> get_ds(int n) {
    vector<vector<int>> res;
    for (int i = 2; i * i <= n; i++)
        if (n % i == 0) {
            int s = 0;
            while (n % i == 0) n /= i, s++;
            res.push_back({i, s});
        }

    if (n > 1) res.push_back({n, 1});
    return res;
}

int get_p(int n, int p) {
    int res = 0;
    while (n / p) res += n / p, n /= p;
    return res;
}

int main() {
    int n, m;
    cin >> n >> m;

    auto ds = get_ds(m);
    int res = 1e8;

    for (int i = 0; i < ds.size(); i++) {
        int p = ds[i][0], s = ds[i][1];
        res = min(res, (get_p(n, p) / s));
    }

    cout << res << endl;

    return 0;
}

4、旋转矩阵

ACwing 3527

#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;

int n;

vector<vector<int>> rotate(vector<vector<int>> a) {
    auto res = a;
    for (int i = 0; i < n; i++)
        for (int j = 0, k = n - 1; j < n; j++, k--)
            res[i][j] = a[k][i];
    return res;
}

int main() {
    cin >> n;
    vector<vector<int>> a(n, vector<int>(n));
    auto b = a;
    for (int i = 0; i < n; i++)
        for (int j = 0; j < n; j++)
            cin >> a[i][j];
    for (int i = 0; i < n; i++)
        for (int j = 0; j < n; j++)
            cin >> b[i][j];
    for (int i = 0; i < 4; i++) {
        if (a == b) {
            cout << i * 90 << endl;
            return 0;
        }
        a = rotate(a);
    }
    puts("-1");
    return 0;
}

5、矩阵幂（矩阵乘法）

ACwing 3534

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

const int N = 15;

int n, m, w[N][N];

// c = a * b
void mul(int c[][N], int a[][N], int b[][N]) {
    static int tmp[N][N];
    memset(tmp, 0, sizeof tmp);
    for (int i = 0; i < n; i++)
        for (int j = 0; j < n; j++)
            for (int k = 0; k < n; k++)
                tmp[i][j] += a[i][k] * b[k][j];
    memcpy(c, tmp, sizeof tmp);
}

int main() {
    cin >> n >> m;
    for (int i = 0; i < n; i++)
        for (int j = 0; j < n; j++)
            cin >> w[i][j];

    int res[N][N] = {0};
    for (int i = 0; i < n; i++) res[i][i] = 1;
    while (m--) mul(res, res, w);
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++)
            cout << res[i][j] << " ";
        cout << endl;
    }
    return 0;
}

6、C翻转

ACwing 3535

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

const int N = 5;

int n, g[N][N];

void rotate(int x, int y, int m) {
    int w[N][N];
    memcpy(w, g, sizeof g);
    for (int i = 0; i < m; i++)
        for (int j = 0, k = m - 1; j < m; j++, k--)
            w[i][j] = g[x + k][y + i];
    for (int i = 0; i < m; i++)
        for (int j = 0; j < m; j++)
            g[x + i][y + j] = w[i][j];
}

int main() {
    for (int i = 0; i < 5; i++)
        for (int j = 0; j < 5; j++)
            cin >> g[i][j];
    int a, b, x, y;
    cin >> a >> b >> x >> y;
    x--, y--;
    if (a == 1) rotate(x, y, b);
    else {
        for (int i = 0; i < 3; i++)
            rotate(x, y, b);
    }
    for (int i = 0; i < 5; i++) {
        for (int j = 0; j < 5; j++)
            cout << g[i][j] << ' ';
        cout << endl;
    }
    return 0;
}