https://ac.nowcoder.com/acm/contest/11255/C

看了大佬的给的思路，然后敲出一个不能说一样，只能说毫无差别的代码。。。一道简单题让我想的有多复杂，看到最长公共子序列以为就是用那个经典dp，，于是想啊想，发现这样搞一遍下来直接超时。。。。真是菜。。。被各种题打击到了连签到题都做不出来。。

AC代码：

#include <iostream>
#include <string>
#include <string.h>
using namespace std;


int main(){
    
    int a,b,c,n;
    cin >> a >> b >> c >> n;
    
    int minn = min(a,min(b,c));
    string s1,s2,s3;
    for(int i = 1;i<=minn;i++) s1 +='a';
    s3 = s2 = s1;
    
    for(int i = 1;i<=a - minn; i++) s1 += 'a',s2 += 'a';
    for(int i = 1;i<=b - minn; i++) s2 += 'b',s3 += 'b';
    for(int i = 1;i<=c - minn; i++) s1 += 'c',s3 += 'c';
    
    if(s1.size() > n || s2.size() > n || s3.size() > n) puts("NO");
    else{
        int len;
        for(int i = 1,len = n - s1.size();i<=len; i++) s1 += 'h';
        for(int i = 1,len = n - s2.size();i<=len; i++) s2 += 'q';
        for(int i = 1,len = n - s3.size();i<=len; i++) s3 += 'j';
        cout << s1 << '\n' << s2 << '\n' << s3 << '\n';
    }
    return 0;
}