数论练习题

聪聪不会秃

已于 2022-07-04 10:26:47 修改

阅读量662

点赞数

CC 4.0 BY-SA版权

文章标签： c++ 算法嵌入式实时数据库线性代数

于 2022-07-04 10:21:22 首次发布

本文链接：https://blog.csdn.net/weixin_51198300/article/details/125583988

1.Divisor SummationSPOJ - DIVSUM

题意：求n的所有因子和（O(N*logN))调和级别

#include <bits/stdc++.h>
#define int long long
#define mp make_pair
#define pb push_back
#define all(a) a.begin(), a.end()
#define rep(i, a, n) for (int i = a; i <= n; i++)
#define per(i, a, n) for (int i = n - 1; i >= a; i--)
#define eps 1e-8
#define zero(x) (((x) > 0 ? (x) : -(x)) < eps)
using namespace std;
const int maxn = 1e6 + 10;
int n, m,d[maxn];

signed main()
{
    // freopen(".in", "r", stdin);
    // freopen(".out", "w", stdout);
    //  ios::sync_with_stdio(false);
    for (int i = 1; i <= 500000; i++)
    {
        for (int j = 2 * i; j <= 500000; j += i)
        {
            d[j] += i;
        }
    }
    int t;
    cin >> t;
    while (t--)
    {
        int n;
        cin >> n;
        cout << d[n] << endl;
    }
    return 0;
}

2.GCD LCM

UVA - 11388

题意：给出LCM与GCD,求最小符合的数a,b

由GCD(a,b) | LCM(a,b)

#include <bits/stdc++.h>
#define int long long
#define mp make_pair
#define pb push_back
#define all(a) a.begin(), a.end()
#define rep(i, a, n) for (int i = a; i <= n; i++)
#define per(i, a, n) for (int i = n - 1; i >= a; i--)
#define eps 1e-8
#define zero(x) (((x) > 0 ? (x) : -(x)) < eps)
using namespace std;
const int maxn = 1e6 + 10;
int n, m;

signed main()
{
    int t;
    cin >> t;
    while (t--)
    {
        int a, b;
        cin >> a >> b;
        if (b % a != 0)
            cout << -1 << endl;