Codeforces: Educational Codeforces Round 98 (Rated for Div. 2)

EDU98

A

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
int main()
{
	int T, n, m;
	scanf("%d", &T);
	while(T)
	{
		T--;
		scanf("%d%d", &n, &m);
		if(n < m)
			swap(n, m);
		m = max(m, n - 1);
		printf("%d\n", n + m);
	}
	return 0;
 } 

B

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
typedef long long LL;
int main()
{
	int T, n;
	LL sum;
	int maxa;
	scanf("%d", &T);
	while(T)
	{
		T--;
		scanf("%d", &n);
		sum = 0;
		maxa = 0;
		for(int i = 1; i <= n; i++)
		{
			int x;
			scanf("%d", &x);
			sum += x;
			maxa = max(maxa, x);
		}
		if((n - 1) * (LL) maxa - sum <= 0)
			cout << (n - 1 - sum % (n - 1)) % (n - 1) << endl;
		else
			cout << (LL)(n - 1) * (LL) maxa - sum << endl;
	}
	return 0;
 } 

C

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<cmath>
#include<cstring>
using namespace std;
const int N = 2e5 + 10;
char s[N];
int main()
{
	int T;
	scanf("%d", &T);
	while(T)
	{
		T--;
		int ans = 0;
		int cnt1 = 0, cnt2 = 0;
		scanf("%s", s + 1);
		int l = strlen(s + 1);
		for(int i = 1; i <= l; i++)
		{
			if(s[i] == '(')
				cnt1++;
			if(s[i] == '[')
				cnt2++;
			if(s[i] == ')' && cnt1)
			{
				cnt1--;
				ans++;
			}
			if(s[i] == ']' && cnt2)
			{
				cnt2--;
				ans++;
			}
		} 
		printf("%d\n", ans);
	}
	return 0;
}