#include<bits/stdc++.h>
using namespace std;
int a[8], cnt, ans[8];
const int maxn = 5000;
int v[maxn][maxn];
int main(){
	int n;
	cin>>n>>a[1]>>a[2]>>a[3]>>a[4]>>a[5]>>a[6]>>a[7];
	for(int i = 1; i <= n; i++){
		for(int j = 1; j <= 7; j++){
			cnt = 0;
			cin>>v[i][j];
			for(int k = 1; k <= 7; k++) if(v[i][j] == a[k]) cnt++;
			switch(cnt){
				case 1:
					ans[6]++;
					break;
				case 2:
					ans[5]++;
					break;
				case 3:
					ans[4]++;
					break;
				case 4:
					ans[3]++;
					break;
				case 5:
					ans[2]++;
					break;
				case 6:
					ans[1]++;
					break;
				case 7:
					ans[0]++;
					break;
			}
		}
	}
	for(int i = 0; i < 7; i++){
		cout<<ans[i]<<' ';
	} 
	return 0;
}

代码怎么了？