51nod 1024 矩阵中不重复的元素

51nod 1024

中文题意

看了下讨论区的做法取对数真的很巧妙啊 乘法就转换成加法了

但是我们可以把100以内的次方数预处理出来 这样就可以用一个pair<int ,int > 的st去处理答案了

#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <cmath>
#include <map>
#include <stack>
#include <set>
#include <sstream>
#include <vector>
#include <stdlib.h>
#include <algorithm>
#include <random>
#include <ctime>
using namespace std;

#define dbg(x) cout<<#x<<" = "<< (x)<< endl
#define dbg2(x1,x2) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<endl
#define dbg3(x1,x2,x3) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<" "<<#x3<<" = "<<x3<<endl
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))

typedef pair<int,int> pll;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const int _inf = 0xc0c0c0c0;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const ll _INF = 0xc0c0c0c0c0c0c0c0;
const ll mod =  (int)1e9+7;

ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll ksm(ll a,ll b,ll mod){int ans=1;while(b){if(b&1) ans=(ans*a)%mod;a=(a*a)%mod;b>>=1;}return ans;}
ll inv2(ll a,ll mod){return ksm(a,mod-2,mod);}
map<int ,int > mp,mp_;
set<pair<int ,int > >st;
set<long long > st_;
void init()
{
    for(int i = 1;i<=100;++i) mp[i] =  1,mp_[i] = i;
    for(int i = 2;i*i<=100;i++)
    {
        for(int j = 2;;j++)
        {
            int tmp = 1;
            for(int k = 1;k<=j;++k)
                tmp*=i;
            if(tmp>100) break;
            else
            {
                if(j>mp[tmp]) mp[tmp] = j,mp_[tmp] = i;
            }
        }
    }
}
int main()
{
    //ios::sync_with_stdio(false);
    //freopen("a.txt","r",stdin);
    //freopen("b.txt","w",stdout);
    int n,m,a,b;
    scanf("%d%d%d%d",&m,&n,&a,&b);
    init();
    for(int i = 1;i<=n;++i)
    {
        for(int j = 1;j<=m;++j)
        {
            st.insert(make_pair(mp_[a+i-1],mp[a+i-1]*(b+j-1)));
        }
    }
    printf("%d\n",st.size());
    //fclose(stdin);
    //fclose(stdout);
    //cout << "time: " << (long long)clock() * 1000 / CLOCKS_PER_SEC << " ms" << endl;
    return 0;
}