Polo the Penguin and Strings_little penguin polo adores strings. but most of…-CSDN博客

本文链接：https://blog.csdn.net/qq_45067380/article/details/100640976

本文探讨了如何找到满足特定条件的最小字典序字符串，包括长度为n且恰好包含k个不同字符，相邻字符不相同，以及在所有符合条件的字符串中字典序最小。提供了一个C++代码示例来解决这个问题。

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

Little penguin Polo adores strings. But most of all he adores strings of length n.
One day he wanted to find a string that meets the following conditions:
The string consists of n lowercase English letters (that is, the string’s length equals n), exactly k of these letters are distinct.
No two neighbouring letters of a string coincide; that is, if we represent a string as s = s1s2… sn, then the following inequality holds, si ≠ si + 1(1 ≤ i < n).
Among all strings that meet points 1 and 2, the required string is lexicographically smallest.
Help him find such string or state that such string doesn’t exist.
String x = x1x2… xp is lexicographically less than string y = y1y2… yq, if either p < q and x1 = y1, x2 = y2, … , xp = yp, or there is such number r (r < p, r < q), that x1 = y1, x2 = y2, … , xr = yr and xr + 1 < yr + 1. The characters of the strings are compared by their ASCII codes.

Input
A single line contains two positive integers n and k (1 ≤ n ≤ 106, 1 ≤ k ≤ 26) — the string’s length and the number of distinct letters.

Output
In a single line print the required string. If there isn’t such string, print “-1” (without the quotes).

Examples
Input
7 4

Output
ababacd

Input
4 7

Output
-1

代码如下：

#include"stdio.h"
using namespace std;
int main()
{
    long long n;
    int k;
    scanf("%lld %d",&n,&k);
    if(n==1&&k==1)
    {
        printf("a");
        return 0;
    }
    if(n<k||k==1)
    {
        printf("-1");
        return 0;
    }
    char c=99;
    for(int i=1;i<=n;i++)
    {
        if(i<=n-(k-2)&&i%2==1)
        {
            printf("a");
        }
        else if(i<=n-(k-2)&&i%2==0)
        {
            printf("b");
        }
        else if(i>n-(k-2))
        {
            printf("%c",c);
            c++;
        }
    }
    return 0;
}