全WA了,用递归做的
查看原帖
全WA了,用递归做的
251157
Aresene楼主2021/12/16 14:05

垃圾写的。求大佬帮助

#include <bits/stdc++.h>
using namespace std;
int n,prize[7];
int js(int x,int y,int a[][7]){
	int win;
	bool won;
	if(x > 7)return 0;
	else {
		for(int i = 1;i <= n;i++){
			if(a[x][y] == prize[i]){
				win = 1+js(x+1,y,a);
				won = true;
				break;		
			}
	}	
	}
	if(won != true)win = js(x+1,y,a);
	return win;
}

int main(){
	cin >> n;
	int a[n][7];
	for(int i = 1;i <= 7;i++)cin >> prize[i];
	for(int i = 1;i <= n;i++)for(int j = 1;j <= 7;j++)cin >> a[i][j];
	int win[n],ans[7];
	memset(ans,0,sizeof(ans));
	for(int i = 1;i <= n;i++)win[i] = js(1,i,a);
	for(int i = 1;i <= n;i++){
		if(win[i] == 1){ans[7]+=1;}
		if(win[i] == 2){ans[6]+=1;}
		if(win[i] == 3){ans[5]+=1;}
		if(win[i] == 4){ans[4]+=1;}
		if(win[i] == 5){ans[3]+=1;}
		if(win[i] == 6){ans[2]+=1;}
		if(win[i] == 7){ans[1]+=1;}
	}
	for(int i = 1;i <= 7;i++)cout << ans[i] << " ";
	cout << endl;
	return 0;
}
2021/12/16 14:05
加载中...