Educational Codeforces Round 82 (Rated for Div. 2)

#include<bits/stdc++.h>

#define inf 0x3f3f3f3f


using namespace std;

int b[105];
string s;

int main(){
	int t;
	cin>>t;
	while(t--){
		cin>>s;
		int k = 0;
		int l = s.length();
		//int flag = 0;
		for(int i=0;i<l;i++){
		   if(s[i] == '1'){
		   	  b[k] = i;//记录每个1的位置 
		   	  k++;
		   }
		}
		if(k == 0){//没有出现1 
			cout<<0<<endl;
			continue;
		}
		int res;//每对1之间距离 
		int ans = 0;//总的删去的0 
		for(int i=0;i+1<k;i++){
			res =  b[i+1]-b[i]-1; 
			ans += res;
		}
		if(!ans) cout<<0<<endl; 
		else{
			cout<<ans<<endl;
		}
	}
	return 0;
} 

#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

ll n,g,b;
ll ans;
        
int main()
{   
    ll t;
	cin>>t;
	while(t--)
    {   
        
		cin>>n>>g>>b;
		ll res=(n+1)/2;
		
		if(res<=g)
			cout<<n<<endl;
		else 
		{
			ll num=res/g;
			
			if(res%g==0)
				ans=(num-1)*(g+b)+g; 
			else 
				ans=(num)*(g+b)+res%g;
				
			cout<<max(ans,n)<<endl;
		}
	}
	
	return 0;
}

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
char str[205],ans[105];
bool vis[105];

int main()
{
	int T;  scanf("%d",&T);
	while (T--)
	{
		scanf("%s",str+1);
		int n=strlen(str+1),l=27,r=27,now=27,flag=0;
		ans[l]=str[1];
		memset(vis,0,sizeof(vis));
		vis[str[1]-'a']=1;
		for (int i=2;i<=n;i++)
		{
			if (now>l&&ans[now-1]==str[i])
                now--;
			else if (now<r&&ans[now+1]==str[i])
                now++;
			else if (now==l&&!vis[str[i]-'a'])
                ans[--l]=str[i],now--,vis[str[i]-'a']=1;
			else if (now==r&&!vis[str[i]-'a'])
                ans[++r]=str[i],now++,vis[str[i]-'a']=1;
			else
			{
			    flag=1;
                break;
            }
		}
		if (flag)
            puts("NO");
		else
		{
			puts("YES");
			for (int i=l;i<=r;i++)
                putchar(ans[i]);
			for (int i=0;i<26;i++)
				if (!vis[i]) putchar(i+'a');
			puts("");
		}
	}
	return 0;
}

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

int main()
{
	int t;cin>>t;
	while (t--)
    {
        ll s,n,m,x,ans;
		cin>>n>>m;
		s=ans=0;
		multiset<ll,greater<ll>> f;
		while (m--)
        {
            cin>>x;
            s+=x;
            f.insert(x);
        }
		if (s<n)
            cout<<"-1"<<endl;
		else
		{
			while(n)
			{
				m=*f.begin();
				f.erase(f.begin());
				if(m<=n)
				{
				    n-=m;
				    s-=m;
				}
				else if(s-m<n)
                {
                    ans++;
                    f.insert(m/2);
                    f.insert(m/2);
                }
				else
                    s-=m;

			}

			cout<<ans<<endl;
		}
	}
}