• [1263] All Kill

  • 时间限制: 2000 ms 内存限制: 65535 K
  • 问题描述
  • Now is the Z country's extraordinary period,Ning x City broke out in a procession, the relevant departments accidentally get some data, by analysis,
    this is M country' ciphertext. . . Now, we get the correct way to decryption .
    Now,you have to do it, for each of the ciphertext, presence a number x of corresponding , represents the originaltext. moved to the right of the x-bit to get
    ciphertext, and now output correct the original.If you donn't,you will be kill !!!

  • 输入
  • This problem contains several cases.
    The first line of each case is the ciphertext(the length < 100000).
    The next line is the number,that is every ciphertext'x.
  • 输出
  • printf the originaltext. You have to leave a blank line between each two cases.
  • 样例输入
  • abcdxyz
  • 样例输出
  • Case 1: zzzzwww
    Case 2: ZZZZWWW
  • 提示
  • 来源
  • Three-God
  • 操作