Codeforces Round #619 (Div. 2)

A - Three Strings

a串和b串的第i个字符一定其中有一个一定和c的第i个相同；

#include <bits/stdc++.h>
using namespace std;
int main()
{
	int t;
	cin >>t;
	while(t--)
	{
		string a,b,c;
		cin >>a>>b>>c;
		int flag=1;
		for(int i=0;i<a.size();i++)
		{
			if(a[i]!=c[i]&&b[i]!=c[i])
			{
				flag=0;
				break;
			}
		}
		if(flag) cout <<"YES"<<endl;
		else cout <<"NO"<<endl;
	}
}

.
.
.

B - Motarack’s Birthday

我直接找的和-1相邻的数字的最大值和最小值，然后求得平均数；

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a[100005];
int main()
{
	int t;
	cin >>t;
	while(t--)
	{
		int n;
		cin >>n;
		cin >>a[0];
		//a[n]=0x3f3f3f3f;
		ll maxx=-1;
		ll x=-99,y=0x3f3f3f3f;
		int cot=0;
		if(a[0]==-1) cot++;
		
		for(int i=1;i<n;i++)
		{
			cin >>a[i];
			if(a[i]!=-1&&a[i-1]==-1 ) x=max(x,a[i]),y=min(y,a[i]);
			if(a[i]==-1)
			{
				cot++;
				if(a[i-1]!=-1) x=max(x,a[i-1]),y=min(y,a[i-1]);
			}
			if(a[i]!=-1&&a[i-1]!=-1) maxx=max(maxx,abs(a[i]-a[i-1]));
			
		}
		//cout <<x<<" "<<y<<endl;
		ll k=(x+y)/2;
		if(a[0]==-1) a[0]=k;
		for(int i=1;i<n;i++)
		{
			if(a[i]==-1) a[i]=k;
			maxx=max(maxx,abs(a[i]-a[i-1]));
		}
		if(cot==n) cout <<0<<" "<<42<<endl;
		else cout <<maxx<<" "<<k<<endl;
	}
}

.
.
.

C - Ayoub’s function

组合数+贪心；

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
	int t;
	cin >>t;
	while(t--)
	{
		ll n,m;
		cin >>n>>m;
		ll x=n*(n-1)/2+n;
		ll p=(n-m)/(m+1);
		ll q=(n-m)%(m+1);
		ll y=0;
		y+=(m+1-q)*(p*(p-1)/2+p);
		y+=q*((p+1)*p/2+p+1);
		cout <<x-y<<endl;
	}
}