String Successor

最新推荐文章于 2025-03-20 21:03:47 发布

原创最新推荐文章于 2025-03-20 21:03:47 发布 · 756 阅读

0 ·

CC 4.0 BY-SA版权

本文介绍了一种计算字符串继承的算法，遵循特定规则递增字符串中的字母和数字，处理各种边界情况，如进位和字符串扩展。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

D - String Successor

Time Limit:2000MS Memory Limit:65536KB 64bit IO Format:%lld & %llu

Submit Status

Appoint description:

Description

The successor to a string can be calculated by applying the following rules:

Ignore the nonalphanumerics unless there are no alphanumerics, in this case, increase the rightmost character in the string.
The increment starts from the rightmost alphanumeric.
Increase a digit always results in another digit ('0' -> '1', '1' -> '2' ... '9' -> '0').
Increase a upper case always results in another upper case ('A' -> 'B', 'B' -> 'C' ... 'Z' -> 'A').
Increase a lower case always results in another lower case ('a' -> 'b', 'b' -> 'c' ... 'z' -> 'a').
If the increment generates a carry, the alphanumeric to the left of it is increased.
Add an additional alphanumeric to the left of the leftmost alphanumeric if necessary, the added alphanumeric is always of the same type with the leftmost alphanumeric ('1' for digit, 'A' for upper case and 'a' for lower case).

Input

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

Each test case contains a nonempty string s and an integer 1 ≤ n ≤ 100. The string s consists of no more than 100 characters whose ASCII values range from 33('!') to 122('z').

Output

For each test case, output the next n successors to the given string s in separate lines. Output a blank line after each test case.

Sample Input

4
:-( 1
cirno=8 2
X 3
/**********/ 4

Sample Output

:-)

cirno=9
cirnp=0

Y
Z
AA

/**********0
/**********1
/**********2
/**********3

代码：

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<string>
using namespace std;
int t,n;
char s[105],str[105];
int main()
{
    cin>>t;
    while(t--)
    {
        int i,j,count=0;
        //cin>>s>>n;
        scanf("%s%d",s,&n);
        int cnt=0,len=strlen(s);
        for(i=0; i<len; i++)
        {
            str[i]=s[len-i-1];
            if((s[i]>='a'&&s[i]<='z')||(s[i]>='A'&&s[i]<='Z')||(s[i]>='0'&&s[i]<='9'))
            {
                count++;
                cnt=max(cnt,len-i-1);
            }
        }
        while(n--)
        {
            int count1=count,step=1;
            for(i=0; i<len; i++)
            {
                if(count&&step)
                {
                    if((str[i]>='a'&&str[i]<='z')||(str[i]>='A'&&str[i]<='Z')||(str[i]>='0'&&str[i]<='9'))
                    {
                        step=0;
                        char c=str[i];
                        if(c=='9')
                        {
                            str[i]='0';
                            step++;
                            if(len-1==i)
                            {
                                str[len]='1';
                                cnt=len++;
                                break;
                            }else if(cnt==i)
                            {
                                for(j=len;j>i+1;j--)str[j]=str[j-1];
                                str[cnt+1]='1';
                                cnt=i+1;
                                len++;
                                break;
                            }
                        }
                        else if(c=='Z')
                        {
                            str[i]='A';
                            step++;
                            if(len-1==i)
                            {
                                str[len]='A';
                                cnt=len++;
                                break;
                            }else if(cnt==i)
                            {
                                 for(j=len;j>i+1;j--)str[j]=str[j-1];
                                str[cnt+1]='A';
                                cnt=i+1;
                                len++;
                                break;
                            }
                        }
                        else if(c=='z')
                        {
                            str[i]='a';
                            step++;
                            if(len-1==i)
                            {
                                str[len]='a';cnt=len++;
                                break;
                            }else if(cnt==i)
                            {
                                for(j=len;j>i+1;j--)str[j]=str[j-1];
                                str[cnt+1]='a';
                                cnt=i+1;
                                len++;
                                break;
                            }
                        }
                        else
                        {
                            str[i]++;
                        }
                    }
                }
                else if(step)
                {
                    step=0;
                    str[i]++;
                    if((str[i]>='a'&&str[i]<='z')||(str[i]>='A'&&str[i]<='Z')||(str[i]>='0'&&str[i]<='9'))
                        count1++;
                }
                count=count1;
            }
            for(i=len-1; i>=0; i--)
                printf("%c",str[i]);
            printf("\n");
        }
        printf("\n");
    }
    return 0;
}