Water topic

Catalog

F Garage Kit

Ideas ： Is there a cubic number of violence n Factor of

#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
const ll inf=0x3f3f3f3f3f;
const ll maxn=2e5+10;
map<ll,ll> mp;
ll t,n;
ll cnt[maxn];
ll m;
void init(){
    
    for(int i=1;;i++){
    
        if((ll)i*i*i>1e9){
    
            break;
        }
        cnt[++m]=i*i*i;
    }
}
int main()
{
    
    init();
    scanf("%lld",&t);
    while(t--){
    
        scanf("%lld",&n);
        ll ans=0;
        for(int i=1;i<=m;i++){
    
            if(n%cnt[i]==0){
    
                ans++;
            }
        }
        printf("%lld\n",ans);
    }
    return 0;
}

G Infinite

Ideas ： Thinking questions .
Found by typing the table , Satisfy the following formula ：

f[n]=f[n-1]+f[n-2]+1

#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
const ll inf=0x3f3f3f3f3f;
const ll maxn=2e5+10;
const ll mod=998244353;
ll p;
ll pqow(ll a,ll b){
    
    ll res=1;
    while(b){
    
        if(b&1)res=res^a%mod;
        a=a^a%mod;
        b>>=1;
    }
    return res%mod;
}
int main()
{
    
    cin>>p;
    ll x=0,y=0;
    ll ans=0;
    for(int i=1;i<=p;i++){
    
        ans=(x+y+1)%mod;
        x=y%mod;
        y=ans%mod;
    }
    cout<<ans;
    return 0;
}

J Sign in

Ideas ： First count d-c Result , Whether there is corresponding violence a+b

#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
const ll maxn=1e5+10;
ll n;
ll a[maxn];
map<ll,ll> mp;
int main()
{
    
    scanf("%lld",&n);
    for(int i=1;i<=n;i++){
    
        scanf("%lld",&a[i]);
    }
    sort(a+1,a+1+n);
    for(int i=n;i>1;i--){
    
        for(int j=i-1;j>=1;j--){
    
            mp[(a[i]-a[j])]=1;
            //cout<<(a[i]-a[j])<<endl;
        }
    }
    for(int i=1;i<=n;i++){
    
        if(mp[a[i]*2]){
    
            printf("Yes");
            return 0;
        }
    }
    for(int i=1;i<n;i++){
    
        for(int j=i+1;j<=n;j++){
    
            if(mp[(a[i]+a[j])])
            {
    
                printf("Yes");
                return 0;
            }
        }
    }
    printf("No");
    return 0;
}

L HPU

Ideas ： violence , use substr function

#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
const ll inf=0x3f3f3f3f3f;
const ll maxn=2e5+10;
string s;
string t="HPU";
int main()
{
    
    cin>>s;
    int n=s.length();
    ll ans=0;
    for(int i=0;i<n;i++){
    
        if(s.substr(i,3)==t){
    
            ans++;
        }
    }
    cout<<ans;
    return 0;
}

Conclusion

• Never decide Ask the spring breeze
• The spring breeze is silent That is, follow your heart
• If my heart can settle How can you not make up your mind when you are in trouble Spring breeze also has spring breeze sorrow Don't worry about me .
• Since then, the spring breeze has filled my sleeves , Just for the sake of peace .