牛客小BAI月赛1

---

水题挺多的，但是不会的是真不会啊
题目链接

A.简单题

#include<bits/stdc++.h>
#define ll long long
using namespace std;
const ll Max=1e7+3;
const double e=exp(1);
int main()
{
    ios::sync_with_stdio(false);
    ll t,m,n,k;
    cin>>t;
    while(t--)
    {   cin>>n>>m>>k;
        double sum=pow(e,n)*m*1.0;
        cout<<fixed<<setprecision(k)<<sum<<endl;
    }
}

B.简单题2

#include<bits/stdc++.h>
#define ll long long
using namespace std;
const ll Max=1e7+3;
const double e=exp(1);
int main()
{
    ios::sync_with_stdio(false);
    ll t,m,n,k;
    cin>>t;
    while(t--)
    {   cin>>n>>m>>k;
        double sum=pow(n,e)/m*1.0;
        cout<<fixed<<setprecision(k)<<sum<<endl;
    }
}

C.分元宵

用了个快速幂

#include<bits/stdc++.h>
#define ll long long
using namespace std;
const ll Max=1e7+3;
const double e=exp(1);
ll a[Max];
ll b[Max];
ll m;
map<int ,int>mp;
long long fastPower(long long base, long long power) {
    long long result = 1;
    base%=m;
    while (power > 0) {
        if (power & 1) {//此处等价于if(power%2==1)
            result = (result * base) % m;
        }
        power >>= 1;//此处等价于power=power//
        base = (base * base) % m;
    }
    return result;
}
int main()
{
    ios::sync_with_stdio(false);
    ll x,y,z,n;
    cin>>x>>y>>z>>n>>m;
    x%=m;y%=m;
    if(x*y==0)
      cout<<0<<endl;
    else 
    {
    cout<<fastPower(x*y,z*n)<<endl;}
   
}

D.多项式乘法

#include<bits/stdc++.h>
#define ll long long
using namespace std;
const ll Max=1e7+3;
const double e=exp(1);
ll a[Max];
ll b[Max];
map<int ,int >mp;
int main()
{
    ios::sync_with_stdio(false);
    ll n,m;
    cin>>n>>m;
    for(int i=0;i<=n;i++)
        cin>>a[i];
    for(int i=0;i<=m;i++)
        cin>>b[i];
    for(int i=0;i<=n;i++)
        for(int j=0;j<=m;j++)
    {
        mp[i+j]+=a[i]*b[j];
    }
    for(int i=0;i<=n+m;i++)
        cout<<mp[i]<<" ";
    cout<<endl;

}

E.圆与三角形

#include<bits/stdc++.h>
#define ll long long
using namespace std;
const ll Max=1e7+3;
const double e=exp(1);
ll a[Max];
ll b[Max];
map<int ,int >mp;
int main()
{
    ios::sync_with_stdio(false);
    double r;
    cin>>r;
    printf("%.2lf\n",r+1.0);

}

J.おみやげをまらいました

#include<bits/stdc++.h>
#define ll long long
using namespace std;
const ll Max=1e7+3;
const double e=exp(1);
ll a[Max];
ll b[Max];
map<string ,string>mp;
map<string ,int> p;
int main()
{
    ios::sync_with_stdio(false);
    double r;
     string s1,s2,s3[3];
    for(int i=0;i<3;i++)
    {
        cin>>s1>>s2;
        mp[s2]=s1;
        p[s1]=1;
    }
    ll n;
    cin>>n;
    while(n--)
    {
        cin>>s1;
        if(p[s1])
        cout<<mp[s1]<<endl;
        else cout<<"Fake"<<endl;
    }

}