static void solve(  ){
//		print();
		for(int i = 0 ; i < clave.length; i++ ){
			if(clave[i]==hint[i]){
				strong++;
				usados[i]=true;
				isMatched[i]=true;
			}
		}

		for(int i = 0 ; i < clave.length; i++ ){
			boolean found = false;
			if( !isMatched[i] )
				for (int j = 0; j < hint.length && !found; j++) {
					if( clave[i]==hint[j] && !usados[j]){
						weak++;
						usados[j]=true;
						found=true;
					}
				}
		}
	}