C(clang 3.9) 解法, 执行用时: 1ms, 内存消耗: 364K, 提交时间: 2019-11-17 15:47:43

#include<stdio.h>
#include<string.h>
int main()
{
	int i,j,k,n,a,s2,s3,add,no;
	char cha,c;
	int p[12][7];
	char s[30];
	while(scanf("%d\n%c",&n,&cha)!=EOF)
	{
		  no=(int)cha-82;	
         for(i=1;i<=n;i++)
		{  memset(p,0,sizeof(p));
		    s2=s3=0;
			scanf("%s",s);  	
			for(j=0;j<=26;j=j+2)
			{
				  p[s[j]-48][s[j+1]-82]++;
				  p[0][s[j+1]-82]++;
				  if(p[0][no]>0)break;
			      if(p[s[j]-48][s[j+1]-82]==2)s2++;
				  else if(p[s[j]-48][s[j+1]-82]==3){s2--;s3++;}	  
			}
			if(p[0][no]>0)printf("No\n");
			else{
				  if(s2==7||(s3==4&&s2==1))printf("Yes\n");
				                      else printf("No\n");	
			     }}
		
	}
}

Ruby(2.4.2) 解法, 执行用时: 48ms, 内存消耗: 8604K, 提交时间: 2019-11-17 16:30:00

until STDIN.eof?
	N = gets.to_i
	T = gets.chomp
	N.times do
		set = Hash.new
		set.default = 0
		str = gets.chomp
		i = 0
		while i < 28
			set[str[i..(i + 1)]] += 1
			i += 2
		end
# 		STDERR.puts "#{set}"
		if str.include? T
			puts "No"
		elsif set.size == 7
			succ = true
			set.each_value do |x|
				succ = false unless x == 2
			end
			if succ 
				puts "Yes"
			else
				puts "No"
			end
		elsif set.size == 5
			k = 0
			d = 0
			set.each_value do |x|
				k += 1 if x == 3
				d += 1 if x == 2
			end
			if k == 4 and d == 1
				puts "Yes"
			else
				puts "No"
			end
		else
			puts "No"
		end
	end
end

Python3(3.5.2) 解法, 执行用时: 21ms, 内存消耗: 3284K, 提交时间: 2019-11-17 16:47:54

def test(s,lost):
    if lost in s:
        return "No"
    mdict={}
    for i in range(0,len(s)-1,2):
        if s[i:i + 2] not in mdict:
            mdict[s[i:i + 2]] = 1
        else:
            mdict[s[i:i + 2]] += 1
    L=list(mdict.values())
    L.sort()
    l1=[2,3,3,3,3]
    l2=[2,2,2,2,2,2,2]
    if L==l1 or L==l2:
        return "Yes"
    else:return "No"
while True:
    try:
        N=int(input())
        lost=input()
        L1=[]
        for i in range(N):
            L1.append(input())
        for i in  L1:
            print(test(i,lost))
    except:break

C++(clang++11) 解法, 执行用时: 3ms, 内存消耗: 408K, 提交时间: 2020-11-25 09:45:35

#include<bits/stdc++.h>
using namespace std;
int main() {
	int n;
	char c;
	while(cin>>n) {
		cin>>c;
		for(int i=0; i<n; i++) {
			int  f[256]= {},h[3000]= {0};
			int a;
			char d;
			for(int k=0; k<14; k++) {
				cin>>a>>d;
				f[d]=1;
				h[a*d]++;
			}
			int cn[15]={};
			if(f[c]){
				puts("No");
				continue;
			}
			for(int k=1;k<3000;k++)
			cn[h[k]]++;
			if(cn[2]*2+cn[4]*4==14||cn[3]==4&&cn[2]==1)puts("Yes");
			else puts("No");
		}
	}
	return 0;
}