刷题记录（NC23047 华华给月月出题，NC15164 Big Water Problem，NC50454 A Simple Problem with Integers）

最新推荐文章于 2024-09-14 22:25:23 发布

rootting

最新推荐文章于 2024-09-14 22:25:23 发布

阅读量93

点赞数

分类专栏：刷题记录文章标签：算法

本文链接：https://blog.csdn.net/m0_60531106/article/details/127797287

版权

刷题记录专栏收录该内容

103 篇文章 0 订阅

订阅专栏

NC23047 华华给月月出题

题目链接

关键点：

1、要将1-n的所有数的n次方给求出来进行异或，可以发现

(a*b)^c = (a^c)*(b^c)

因此，对于素数的幂，我们就利用快速幂来求，而对于合数的幂，我们利用其因数的幂相乘求出

2、可以在线性筛素数时，额外开一个数组来专门存储和计算幂

3、最后在1-n内的所有幂进行异或即可

快速幂

ll kuai(ll x, ll y)
{
    ll base = x;
    ll ans = 1;
    while (y)
    {
        if (y&1)
            ans = ans*base%MOD;
        base = base*base%MOD;
        y>>=1;
    }
    return ans;
}

完整代码：

# include <iostream>
# include <cstdio>
using namespace std;
typedef long long ll;
const int N = 2e7;
int fac[N], prime[N], vis[N];
ll MOD = 1e9+7;
ll n, cnt;
ll kuai(ll x, ll y)
{
    ll base = x;
    ll ans = 1;
    while (y)
    {
        if (y&1)
            ans = ans*base%MOD;
        base = base*base%MOD;
        y>>=1;
    }
    return ans;
}
void find(ll n)
{
    fac[1] = 1;
    for (int i=2; i<=n; i++)
    {
        if (!vis[i])
        {
            vis[i] = i;
            fac[i] = kuai(i, n);
            prime[++cnt] = i;
        }
        for (int j=1; j<=cnt; j++)
        {
            if (prime[j]>vis[i] || i*prime[j]>n)
                break;
            vis[i*prime[j]] = prime[j];
            fac[i*prime[j]] = fac[i]*fac[prime[j]]%MOD;
        }
    }
}
int main()
{
    cin>>n;
    ll ans = 0;
    find(n);
    for (int i=1; i<=n; i++)
    {
        ans ^= fac[i];
    }
    cout<<ans<<endl;
    return 0;
}

NC15164 Big Water Problem（线段树模板）

题目链接

完整代码：

# include <iostream>
# include <cstdio>
using namespace std;
typedef long long ll;
const int N = 100000+10;
int n, m;
ll a[N*4], tree[N*4];
void build(int p, int l, int r)
{
    if (l == r)
    {
        tree[p] = a[l];
        return ;
    }
    int mid = (l+r)/2;
    build(2*p, l, mid);
    build(2*p+1, mid+1, r);
    tree[p] = tree[2*p] + tree[2*p+1];
}
void Add(int p, int l, int r, int pos, int num)
{
    if (l == r)
    {
        tree[p] += num;
        return ;
    }
    int mid = (l+r)/2;
    if (pos<=mid) Add(2*p, l, mid, pos, num);
    else Add(2*p+1, mid+1, r, pos, num);
    tree[p] = tree[2*p] + tree[2*p+1];
}
ll Calc(int p, int l, int r, int x, int y)
{
    if (x<=l && y>=r)
    {
        return tree[p];
    }
    int mid = (l+r)/2;
    if (y<=mid) return Calc(2*p, l, mid, x, y);
    if (x>mid) return Calc(2*p+1, mid+1, r, x, y);
    return Calc(2*p, l, mid, x, mid) + Calc(2*p+1, mid+1, r, mid+1, y);
//     ll ans = 0;
//     if (x<=mid) ans += Calc(p*2, l, mid, x, y);
//     if (y>mid) ans += Calc(p*2+1, mid+1, r, x, y);
}
int main()
{
    cin>>n>>m;
    for (int i=1; i<=n; i++)
        cin>>a[i];
    build(1, 1, n);
    for (int i=1; i<=m; i++)
    {
        int c, x, y;
        cin>>c>>x>>y;
        if (c == 1)
        {
            Add(1, 1, n, x, y);
        }
        else
            cout<<Calc(1, 1, n, x, y)<<endl;
    }
    
    
    return 0;
}

NC50454 A Simple Problem with Integers（求助）

题目链接

哪位大佬可以帮忙看看是哪里出问题了，一直找不到错误

# include <iostream>
# include <cstdio>
using namespace std;
typedef long long ll;
const int N = 1000000+10;
int n, m;
ll a[N*4], tree[N*4], lazy[N*4];
void build(int p, int l, int r)
{
    if (l == r)
    {
        tree[p] = a[l];
        return ;
    }
    int mid = (l+r)/2;
    build(2*p, l, mid);
    build(2*p+1, mid+1, r);
    tree[p] = tree[2*p] + tree[2*p+1];
}
void pushdown(int p, int l, int r)
{
    int mid = (l+r)/2;
    lazy[2*p] += lazy[p];
    lazy[2*p+1] += lazy[p];
    tree[2*p] += lazy[p]*(mid-l+1);
    tree[2*p+1] += lazy[p]*(r-(mid+1)+1);
    lazy[p] = 0;
}
void Add(int p, int l, int r, int x, int y, ll num)
{
    if (x<=l && y>=r)
    {
        tree[p] += (r-l+1)*num;
        lazy[p] += num;
        return ;
    }
    if (lazy[p]!=0)
    {
        pushdown(1, l, r);
    }
    int mid = (l+r)/2;
    if (x<=mid) Add(2*p, l, mid, x, y, num);
    if (y>mid) Add(2*p+1, mid+1, r, x, y, num);
    tree[p] = tree[2*p] + tree[2*p+1];
}
ll Calc(int p, int l, int r, int x, int y)
{
    if (x<=l && y>=r)
    {
        return tree[p];
    }
    if (lazy[p]!=0)
    {
        pushdown(p, l, r);
    }
    int mid = (l+r)/2;
//     if (y<=mid) return Calc(2*p, l, mid, x, y);
//     if (x>mid) return Calc(2*p+1, mid+1, r, x, y);
//     return Calc(2*p, l, mid, x, mid) + Calc(2*p+1, mid+1, r, mid+1, y);
    ll ans = 0;
    if (x<=mid) ans += Calc(p*2, l, mid, x, y);
    if (y>mid) ans += Calc(p*2+1, mid+1, r, x, y);
    return ans;
}
int main()
{
    cin>>n>>m;
    for (int i=1; i<=n; i++)
        cin>>a[i];
    build(1, 1, n);
    for (int i=1; i<=m; i++)
    {
        int c;
        cin>>c;
        if (c == 1)
        {
            int l, r;
            ll x;
            cin>>l>>r>>x;
            Add(1, 1, n, l, r, x);
        }
        else
        {
            int l, r;
            cin>>l>>r;
            cout<<Calc(1, 1, n, l, r)<<endl;
        }
            
    }
    
    
    return 0;
}