SDNUOJ——1123.Encoding

最新推荐文章于 2022-02-21 23:07:16 发布

浦柳人

最新推荐文章于 2022-02-21 23:07:16 发布

阅读量228

点赞数

文章标签：水

本文链接：https://blog.csdn.net/weixin_43237242/article/details/90453036

版权

SDNUOJ 专栏收录该内容

42 篇文章 0 订阅

订阅专栏

Description
Given a string containing only ‘A’ - ‘Z’, we could encode it using the following method:

Each sub-string containing k same characters should be encoded to “kX” where “X” is the only character in this sub-string.
If the length of the sub-string is 1, ‘1’ should be ignored.
Input
The first line contains an integer N (1 <= N <= 100) which indicates the number of test cases. The next N lines contain N strings. Each string consists of only ‘A’ - ‘Z’ and the length is less than 10000.
Output
For each test case, output the encoded string in a line.
Sample Input

2
ABC
ABBCCC

Sample Output

ABC
A2B3C

#include<stdio.h>
#include<iostream>
#include<map>
#include<algorithm>
#include<cstring>
#include<string.h>
#include<math.h>
#include<vector>
#include<map>
using namespace std;
typedef long long ll;
#define MAXN 10005
#define INF 0x3f3f3f3f//将近int类型最大数的一半，而且乘2不会爆int
#define MOD 1000000007

int main()
{
   int t;
   cin >> t;
   while(t--)
   {
       string s;
       cin >>s;
       int len = s.size();
       int x=0;
       for(int i=0; i<len-1; ++i)
       {
           if(s[i] != s[i+1])
           {
               if(x) cout << x+1;
               x=0;
               cout << s[i];
           }
           else
               x++;
       }
       if(x)
        cout << x+1 << s[len-1];
       else
        cout << s[len-1];
       cout << '\n';
   }
    return 0;
}