6. 寻找复读机

叁歲伎倆 2022-04-04 07:18 183阅读 0赞

![watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3dlaXhpbl80MTIwNzE3NQ_size_16_color_FFFFFF_t_70][]

#include "string.h"
    #include "stdio.h"
    int main(int argc, char const *argv[])
    {
        int n, m, flag = 0, count = 0;
        char ch[110], ch1[110],ch2[110];
        for(int i = 0; i < 110; i++)
        {
            ch1[i] = '\0';
            ch2[i] = '\0';
            ch[i] = '\0';
        }
    
        scanf("%d %d", &n, &m);
        int fuduji[n][2], x;
        for (int i = 0; i < n; i++)
        {
            fuduji[i][1] = '1';
        }
        
        
        while (flag < m)
        {
            scanf("%d %s", &x, &ch);
            if(strcmp(ch, ch1) != 0) //与上一个人说的东西不同
            {
                fuduji[x - 1][1] = '0';
                
                strcpy(ch1, ch2);
                strcpy(ch1, ch);
            }
            flag++;
        }
    
        for (int i = 0; i < n; i++)
        {
            if(fuduji[i][1] != '0')
            {
                count = 1;
                break;
            }
        }
    
        if(count == 0)
        {
            ;
        }
        else
        {
            int flag2 = 0;
            for (int i = 0; i < n; i++)
            {
                if(fuduji[i][1] == '1' && flag2 == 0)
                {
                    printf("%d", i + 1);
                    flag2 = 1;
                }
                else if(fuduji[i][1] == '1' && flag2 == 1)
                {
                     printf(" %d", i + 1);
                }
                else
                    ;
            }
            printf("\n");   
        }
    
    
    
        return 0;
    }

[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3dlaXhpbl80MTIwNzE3NQ_size_16_color_FFFFFF_t_70]: /images/20220404/cafc5b7553d146429807c3799aa960a5.png