排序检索-340 Master-Mind Hints

题目大意：统计secret与guess中数字相同且位置相同的个数，以及数字相同但位置不同的个数

解题过程：一次AC

正确代码：

# include <cstdio>
# include <cstdlib>
# include <ctime>
# include <cmath>
# include <iostream>
# include <fstream>
# include <cstring>
# include <string>

//*
#define fin cin
#define fout cout
//*/

using namespace std;

/*
ifstream fin("in.txt");
ofstream fout("out.txt");
//*/
int cmp(const void* a,const void* b){
	return (*(int*)a)-(*(int*)b);
}
int secret[1000];
int guess[1000];
int tempofsecret[1000];
int tempofguess[1000];
int main()
{
	int cases=0;
	int n=1001;
	fin>>n;
	while(n!=0){
		cases++;
		fout<<"Game "<<cases<<":"<<endl;
		for(int i=0;i<n;i++){
			fin>>secret[i];
		}
		for(int i=0;i<n;i++){
			fin>>guess[i];
		}
		while(guess[n-1]!=0){
			int strong=0,weak=0,numoftemp=0;
			for(int i=0;i<n;i++){
				if(secret[i]==guess[i]) {
//					fout<<"strong:"<<i<<" "<<secret[i]<<endl;
					strong++;
				}
				else{
					
					tempofsecret[numoftemp]=secret[i];
					tempofguess[numoftemp]=guess[i];
			//		fout<<"copy"<<tempofsecret[numoftemp]<<" "<<tempofguess[numoftemp]<<endl;
					numoftemp++;
				}
			}
			qsort(tempofsecret,numoftemp,sizeof(tempofsecret[0]),cmp);
			qsort(tempofguess,numoftemp,sizeof(tempofguess[0]),cmp);
			
			for(int i=0,j=0;i<numoftemp&&j<numoftemp;){
				if(tempofsecret[i]==tempofguess[j]){
//					fout<<"weak:"<<i<<" "<<j<<" "<<tempofsecret[i]<<endl;
					weak++;
					i++;
					j++;
				}
				else{
					if(tempofsecret[i]<tempofguess[j]){
						i++;
					}
					else j++;
				}
			}
			fout<<"    ("<<strong<<","<<weak<<")"<<endl;
			for(int i=0;i<n;i++){
				fin>>guess[i];
			}
		}
		fin>>n;
	}
	return 0;
 }