c语言pat基础题0906L1094

Question

我的代码出现问题，本题希望可以得到大家的指导，谢谢你的帮助！

Answer 1

供参考：

#include <stdio.h>
#include <string.h>
int main()
{
    
    char s[200];
    int  n, i;
    scanf("%s", &s);// 输入
    scanf("%d", &n);
    for (i = 0; i < n; i++)
    {
        int len = strlen(s); 
        int j = 0, k = 0, m = 0;
        char s2[200];      // 剪贴板
        int a = 0, b = 0;  // 剪切位置
        char c1[6], c2[6]; // 粘贴位置
        scanf("%d %d %s %s", &a, &b, &c1, &c2);
        for (j = a - 1; j < len; j++) // 第a个元素的数组下标为a-1
        {
            if (k < b - a + 1) // 剪贴字符串长度为 b-a+1
                s2[k++] = s[j]; // 剪贴板存放
            s[j] = s[j + b - a + 1];
        }
        int flag = 0;
        int len1 = strlen(c1); 
        int len2 = strlen(c2);
        for (j = 0; j < len; j++)
        {
            int start = j, num;
            int sum1 = 0, sum2 = 0;
            for (num = 0; num < len1; num++)
            {
                if (s[start] == c1[num])
                {
                    sum1++;
                    start++;
                }
                if (sum1 == len1)
                {
                    int q = 0;
                    for (q = 0; q < len2; q++)
                    {
                        if (s[start] == c2[q])
                        {
                            sum2++;
                            start++;
                        }
                        if (sum2 == len2)
                        {
                            flag = 1;
                            break;
                        }
                    }
                }
                if (flag == 1)
                    break;
            }
            if (flag == 1)
                break;
        }
        if (flag == 1) 
        {
            for (m = len - 1; m >= j + len1 + k; m--)// 后移
            {
                s[m] = s[m - k];
            }
            int number = 0;
            for (number = 0; number < k; number++)// 插入
            {
                s[m - k + 1] = s2[number];
                m++;
            }
        }
        else{
            int number = 0;
            for (m = len - k; m < len; m++)// 在最后插入
            {
                s[m] = s2[number];
                number++;
            }
        }
    }
    puts(s);
    return 0;
}