ZOJ 3713 In 7-bit

In 7-bit

---

Time Limit: 2 Seconds      Memory Limit: 65536 KB

---

Very often, especially in programming contests, we treat a sequence of non-whitespace characters as a string. But sometimes, a string may contain whitespace characters or even be empty. We can have such strings quoted and escaped to handle these cases. However, a different approach is putting the length of the string before it. As most strings are short in practice, it would be a waste of space to encode the length as a 64-bit unsigned integer or add a extra separator between the length and the string. That's why a 7-bit encoded integer is introduced here.

To store the string length by 7-bit encoding, we should regard the length as a binary integer. It should be written out by seven bits at a time, starting with the seven least-significant (i.e. 7 rightmost) bits. The highest (i.e. leftmost) bit of a byte indicates whether there are more bytes to be written after this one. If the integer fits in seven bits, it takes only one byte of space. If the integer does not fit in seven bits, the highest bit is set to 1 on the first byte and written out. The integer is then shifted by seven bits and the next byte is written. This process is repeated until the entire integer has been written.

With the help of 7-bit encoded integer, we can store each string as a length-prefixed string by concatenating its 7-bit encoded length and its raw content (i.e. the original string).

Input

There are multiple test cases. The first line of input is an integer T indicating the number of test cases.

Each test case is simply a string in a single line with at most 3000000 characters.

Output

For each test case, output the corresponding length-prefixed string in uppercase hexadecimal. See sample for more details.

Sample Input

3
42
yukkuri shiteitte ne!!!
https://en.wikipedia.org/wiki/Answer_to_Life,_the_Universe,_and_Everything#Answer_to_the_Ultimate_Question_of_Life.2C_the_Universe_and_Everything_.2842.29

Sample Output

023432
1779756B6B75726920736869746569747465206E65212121
9A0168747470733A2F2F656E2E77696B6970656469612E6F72672F77696B692F416E737765725F746F5F4C6966652C5F7468655F556E6976657273652C5F616E645F45766572797468696E6723416E737765725F746F5F7468655F556C74696D6174655F5175657374696F6E5F6F665F4C6966652E32435F7468655F556E6976657273655F616E645F45766572797468696E675F2E323834322E3239

---

Author: WU, Zejun
Contest: The 10th Zhejiang Provincial Collegiate Programming Contest

#include<cstdio>
#include<cstring>
#include<algorithm>

const int maxn = 3000005;
char str[maxn];
int main()
{
    int ca, len, lc;
    scanf("%d", &ca);
    getchar();
    while (ca--)
    {
        gets(str);
        lc = len = strlen(str);
        for (;;){
            printf("%02X", (lc & 127) + (lc > 127 ? 128 : 0));
            lc = lc >> 7;
            if (!lc) break;
        }
        for (int i = 0; i < len; i++)
            printf("%02X", (int)str[i]);
        printf("
");
    }

    给定一个字符串，要求输出其中的字符的ASCAII码值的十六进制数，并在前面添加表示字符串的长度的编码，这个编码是一组字节，它的定义是，先长度值的二进制数的后七位存放在一个字节中，如果这七位不足以表达长度值（即二进制数第七位左边还有1），则将这个字节的最高位置为1，将长度值的二进制数右移七位。重复这样的操作，直到这个二进制变为0。最后按顺序把这些字节以两位的十六进制数输出。

#include<cstdio>
#include<cstring>
#include<algorithm>

const int maxn = 3000005;
char str[maxn];
int main()
{
    int ca, len, lc;
    scanf("%d", &ca);
    getchar();
    while (ca--)
    {
        gets(str);
        lc = len = strlen(str);
        for (;;){
            printf("%02X", (lc & 127) + (lc > 127 ? 128 : 0));
            lc = lc >> 7;
            if (!lc) break;
        }
        for (int i = 0; i < len; i++)
            printf("%02X", (int)str[i]);
        printf("
");
    }
}