算法练习-模拟石头、剪刀、布

为什么80%的码农都做不了架构师？>>>   

#include"exersize.h"
#include"vector"
using namespace std;


int main(){
	cout<<"########################################"<<endl;
	cout<<"模拟石头、剪刀、布的游戏："<<endl;
	cout<<"0 代表石头, 1 代表剪刀,2 代表布 "<<endl;
	int k=0;
	cout<<"输入需要测试的组数:"<<endl;
	cin>>k;
	vector<int>result(0);
	for(int i=0;i<k;i++){
		int n,na,nb;
		cout<<"输入第"<<i+1<<"组的测试伦数、a、b的出拳周期数:n,na,nb:"<<endl;
		cin>>n>>na>>nb;
		vector <int>va(0);
		vector <int>vb(0);
		int resultA=0;
		int resultB=0;
		cout<<"a的出拳规律:"<<endl;
		for(int i1=0;i1<na;i1++){
			int element;
			cin>>element;
			va.push_back(element);
		}
		cout<<"b的出拳规律:"<<endl;
		for(int i2=0;i2<nb;i2++){
			int elementb;
			cin>>elementb;
			vb.push_back(elementb);
		}
		for(int j=0;j<n;j++){
			int a=va[j%na];
			int b=vb[j%nb];
			if(a==0){
				switch (b){
					 case  0:;break;
					 case  1:resultA++;break;
					 case  2:resultB++;break;
				}
			}
			if(a==1){
				switch(b){
					 case  0:resultB++;break;
					 case  1:;break;
					 case  2:resultA++;break;
				}
			}
			if(a==2){
				switch(b){
					case 0:resultA++;break;
					case 1:resultB++;break;
					case 2:;break;
			
				}
			}
		}
		if(resultA>resultB){
			result.push_back(1);
		}else if(resultA<resultB){
			result.push_back(2);
		}else {
			result.push_back(0);
		}
	}
	for(vector<int>::iterator it=result.begin() ;it!=result.end();){
		if(*(it)==1){
			cout<<"A胜"<<endl;
		}else if(*(it)==2){
			cout<<"B胜"<<endl;
		}else{
			cout<<"平局"<<endl;
		}
		
        it = result.erase(it);  
	}
	system("pause");
	return 0;

}

转载于:https://my.oschina.net/wange/blog/81286