2494718_ac_0ms_336k.cc

北大大牛代码 1240道题的原代码 超级权威

#include <iostream>
#include <string>
#include <algorithm>
using namespace std;

string key, str, end;
string ::iterator iter, Iter;

bool cmp(int a,int b)
{
	if(*(iter+a)==*(iter+b))
		return a < b;
	else
		return *(iter+a)<*(iter+b);
}

int main()
{
	int i, j, len;
	int pos[11], cpy[11];

	end = "THEEND";
	while(cin>>key)
	{
		if(key==end)
			break;
		cin>>str;
		len = key.length();
		iter = key.begin();Iter = str.begin();
		for(i = 0; i < len; i++)
			pos[i] = i;
		sort(pos,pos+len,cmp);
		for(i = 0; i < len; i++)
			cpy[pos[i]] = i;
		for(i = 0; i < str.length()/len; i++)
		{
			for(j = 0; j < len; j++)
				cout<<*(Iter+cpy[j]*str.length()/len+i);
		}
		cout<<endl;
	}
	return 0;
}