RT,代码如下

#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
int T;
int a[5];
int b[10];
int main()
{
	cin >> T;
	while(T--)
	{
		cin >> a[1] >> a[2] >> a[3] >> a[4];
		sort(a + 1, a + 5);
		if((a[1] + 1 == a[2] && a[2] + 1 == a[3]) || (a[2] + 1 == a[3] && a[3] + 1 == a[4]))
			cout << 1 << endl;
		else
		{
			memset(b, 0, sizeof(b));
			b[a[1]]++;
			b[a[2]]++;
			b[a[3]]++;
			b[a[4]]++;
			int aa = -1, bb = -1;
			for(int i = 0; i <= 9; i++)
			{
				if(b[i] == 1 && aa == -1)
					aa = i;
				else if(b[i] == 1) 
					bb = i;
			}
			if(bb - aa == 1 || bb - aa == 2)
				cout << 1 << endl;
			else
				cout << 0 << endl;
		}
	}
	return 0;
}