救救蒟蒻……
查看原帖
救救蒟蒻……
384581
Meng142857楼主2021/6/14 19:23
#include<iostream>
using namespace std;
struct poker{
	string dian;
	int hs,dot;
}a[5][30];
int main(){
	string s;
	while(1){
		for(int i=0;i<=4;i++){
			for(int j=0;j<=24;j++){
				a[i][j].dian="";
				a[i][j].hs=a[i][j].dot=0;
			}
		}
		for(int i=1;i<=4;i++){
			cin>>a[i][0].dot;
			for(int j=1;j<=a[i][0].dot;j++){
				cin>>a[i][j].dian;
				if(a[i][j].dian[0]=='S'){a[i][j].hs=1;}
				if(a[i][j].dian[0]=='H'){a[i][j].hs=2;}
				if(a[i][j].dian[0]=='D'){a[i][j].hs=3;}
				if(a[i][j].dian[0]=='C'){a[i][j].hs=4;}
				a[i][19+a[i][j].hs].dot++;
			}
			if(a[i][0].dot==16){a[i][24].dot=1000;continue;}
			if(a[i][0].dot==0){a[i][24].dot=0;continue;}
			//cout<<a[i][20].dot<<" "<<a[i][22].dot<<endl;
			if(a[i][21].dot==13){
				if(a[i][19].dot+a[i][21].dot==2){a[i][24].dot=500;continue;}
				else{a[i][24].dot=200-(a[i][20].dot+a[i][22].dot)*100;continue;}
			}
			a[i][24].dot-=(a[i][20].dot-a[i][22].dot)*100;
			for(int j=1;j<=a[i][0].dot;j++){
				if(a[i][j].dian.length()==3){a[i][j].dot=(a[i][j].dian[1]-'0')*10+a[i][j].dian[2]-'0';}
				else{a[i][j].dot=a[i][j].dian[1]-'0';}
				if(a[i][j].hs==2){
					if(a[i][j].dot<=10&&a[i][j].dot>=2){a[i][24].dot-=a[i][j].dot;}
					else if(a[i][j].dot!=1){a[i][24].dot-=(a[i][j].dot-9)*10;}
					else{a[i][24].dot-=50;}
				}
				//cout<<a[i][j].dot<<' ';
			}
			//cout<<endl;
		}
		if(a[1][0].dot==0&&a[2][0].dot==0&&a[3][0].dot==0&&a[4][0].dot==0){break;}
		for(int i=1;i<=4;i++){
			if(a[i][24].dot*(a[i][23].dot+1)>0){cout<<"+";}
			cout<<a[i][24].dot*(a[i][23].dot+1)<<" ";
		}
		cout<<endl;
	}
	return 0;
}
2021/6/14 19:23
加载中...