牛客小Bai月赛41（会补）

---

A.小红的签到题

#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<queue>
#include<stack>
#include <limits>
#include<string>
#include<deque>
#include<map>
#include<bitset>
#include<set>
#include<cstdio>
#include<vector>
#define ll long long
#define PI 3.141592653589793
#define E 2.718281828459045
#define HalF (l + r)>>1
#define lsn rt<<1
#define rsn rt<<1|1
#define Lson lsn, l, mid
#define Rson rsn, mid+1, r
#define QL Lson, ql, qr
#define QR Rson, ql, qr
#define myself rt, l, r
#define mem(a,b) memset(a,b,sizeof(a))
#define FOR( i , a , b ) for ( int i = a ; i <= b ; ++ i )
#define FO( i , n ) for ( int i = 0 ; i < n ; ++ i )
#define lowbit(a) ((a)&-(a))
typedef unsigned long long ull;
const ll mod=10007;
const ll INF=0x3f3f3f3f;
const ll Max=1e7+10;
using namespace std;
ll t,n,m;
/*queue<ll> q;
stack<ll> s;
//升序队列
priority_queue <int,vector<int>,greater<int> > q;
//降序队列
priority_queue <int,vector<int>,less<int> >q;*/
int main()
{   ios::sync_with_stdio(false);
    cin>>t>>n>>m;
    cout<<min(m/t,n)<<endl;
    return 0;
}

B.小红的ABC

#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<queue>
#include<stack>
#include <limits>
#include<string>
#include<deque>
#include<map>
#include<bitset>
#include<set>
#include<cstdio>
#include<vector>
#define ll long long
#define PI 3.141592653589793
#define E 2.718281828459045
#define HalF (l + r)>>1
#define lsn rt<<1
#define rsn rt<<1|1
#define Lson lsn, l, mid
#define Rson rsn, mid+1, r
#define QL Lson, ql, qr
#define QR Rson, ql, qr
#define myself rt, l, r
#define mem(a,b) memset(a,b,sizeof(a))
#define FOR( i , a , b ) for ( int i = a ; i <= b ; ++ i )
#define FO( i , n ) for ( int i = 0 ; i < n ; ++ i )
#define lowbit(a) ((a)&-(a))
typedef unsigned long long ull;
const ll mod=10007;
const ll INF=0x3f3f3f3f;
const ll Max=1e7+10;
using namespace std;
ll t,n,m,l;
string s;
ll solve(ll n,ll w)
{   ll sum=0;
    for(ll i=n,j=n;i<=n+w&&j>=n-w;i++,j--)
    {
        if(s[i]==s[j])
            sum++;
        else break;
    }
    if(s[n]==s[n-1]||s[n]==s[n+1])
        return 2;
    return sum*2-1;
}
/*queue<ll> q;
stack<ll> s;
//升序队列
priority_queue <int,vector<int>,greater<int> > q;
//降序队列
priority_queue <int,vector<int>,less<int> >q;*/
int main()
{   ios::sync_with_stdio(false);

    cin>>s;
    l=s.size();
    ll minn=99999;
    for(ll i=1;i<=l/2;i++)
    {
        for(ll j=0;j<l;j++)
        {
            if(solve(j,i)>1)
            {
                minn=min(solve(j,i),minn);
            }
        }
    }if(minn==99999)
    cout<<-1<<endl;
    else
    cout<<minn<<endl;
    return 0;
}

C.小红的口罩

#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<queue>
#include<stack>
#include <limits>
#include<string>
#include<deque>
#include<map>
#include<bitset>
#include<set>
#include<cstdio>
#include<vector>
#define ll long long
#define PI 3.141592653589793
#define E 2.718281828459045
#define HalF (l + r)>>1
#define lsn rt<<1
#define rsn rt<<1|1
#define Lson lsn, l, mid
#define Rson rsn, mid+1, r
#define QL Lson, ql, qr
#define QR Rson, ql, qr
#define myself rt, l, r
#define mem(a,b) memset(a,b,sizeof(a))
#define FOR( i , a , b ) for ( int i = a ; i <= b ; ++ i )
#define FO( i , n ) for ( int i = 0 ; i < n ; ++ i )
#define lowbit(a) ((a)&-(a))
typedef unsigned long long ull;
const ll mod=10007;
const ll INF=0x3f3f3f3f;
const ll Max=1e7+10;
using namespace std;
ll t,n,m,l,sum;
string s;

/*queue<ll> q;
stack<ll> s;
//升序队列
priority_queue <int,vector<int>,greater<int> > q;
//降序队列
priority_queue <int,vector<int>,less<int> >q;*/
int main()
{   ios::sync_with_stdio(false);
    priority_queue<ll,vector<ll>,greater<ll> >q;
    cin>>n>>m;
    for(int i=1;i<=n;i++)
    {cin>>t;
    q.push(t);}
    while(1)
    {  ll o=q.top();
       l+=o;
       q.pop();
       q.push(2*o);
       if(l<=m)
       sum++;
       else break;
    }
    cout<<sum<<endl;
    return 0;
}