牛客小白月赛23 部分题解

#include<bits/stdc++.h>
 
using namespace std;
 
int main(){
    int n;
    cin>>n;
     
    cout<<"4294967296"<<endl;
    return 0;
}

#include<bits/stdc++.h>
 
using namespace std;
int a[100005];
int main(){
    int n;
    cin>>n;
    for(int i=0;i<n;i++){
        cin>>a[i];
    }
    sort(a,a+n);
    cout<<a[n-1]-a[0]<<endl;
    return 0;
}

#include<bits/stdc++.h>
using namespace std;
 
int main(){
    string s;
    cin>>s;
    string st;
    for(int i=0;i<s.size();i++){
        for(int j=i;j<=s.size();j++){
            string ss=s.substr(i,j-i+1);
            if(st<ss)
            st=ss;
        }
    }
    cout<<st;
    return 0;
}

#include<iostream>
#include<map>
#include<vector>
#define ll long long
using namespace std;
ll n,p;
map<ll,ll>prime_factor;
void divide()
{
    ll i;
    for(i=2;i*i<=p;i++)
    {
        while(p%i==0)
        {
            p/=i;
            prime_factor[i]++;
        }
    }
    if(p>1) prime_factor[p]++;
}
void init()
{
    map<ll,ll>e;
    swap(e,prime_factor);
}
bool check(ll x)
{
    ll cnt;
    auto it=prime_factor.begin();
    while(it!=prime_factor.end())
    {
        ll temp=x;
        ll i=it->first;
        cnt=0;
        while(temp)
        {
            cnt+=temp/i;
            temp/=i;
        }
        if(cnt<it->second) return false;
        it++;
    }
    return true;
}
void solve()
{
    init();
    cin>>p;
    ll l=1,r=p;
    divide();
    ll ans;
    while(l<=r)
    {
        int mid=l+r>>1;
        if(check(mid))
        {
            ans=mid;
            r=mid-1;
        }
        else l=mid+1;
    }
    cout<<ans<<endl;
}
int main()
{
    int t;
    cin>>t;
    while(t--) solve();
    return 0;
}