红透半边天
查看原帖
红透半边天
1591737
xieweiwei楼主2025/2/6 18:12
#include <bits/stdc++.h>
using namespace std;

int main() {
	int n;
	cin>>n;
	int a[n+1][7];
	for(int i=0;i<=n;i++){
		for(int j=0;j<7;j++)
		{
			cin>>a[i][j];
		}
	} 
	int s0=0,s1=0,s2=0,s3=0,s4=0,s5=0,s6=0;
	for(int i=0;i<n;i++){
		int t=0;
		for(int j=0;j<7;j++){
			if(a[i][j]==a[n][0] || a[i][j]==a[n][1] || a[i][j]==a[n][2] || a[i][j]==a[n][3] || a[i][j]==a[n][4] || a[i][j]==a[n][5]||a[i][j]==a[n][6])
			{
				t++;
			}
		}
		switch(t){
			case 7:s0++;break;
			case 6:s1++;break;
			case 5:s2++;break;
			case 4:s3++;break;
			case 3:s4++;break;
			case 2:s5++;break;
			case 1:s0++;break;
		}
	}
	printf("%d %d %d %d %d %d %d",s0,s1,s2,s3,s4,s5,s6);
	return 0;
}
2025/2/6 18:12
加载中...