Problem G: 车牌限行

写这种题还发文的都是菜鸡找成就感

#include<stdio.h>
#include<string.h>
void opop(int k) {
    int pl[8];
    for(int p=1;p<=7;p++){
        pl[p]=p;
    }
    for (int i = 1; i <= 7; i++) {
      if(i==k)continue;
             if (i == 1||(k==1&&i==2))printf("%d", pl[i]);
             else printf(" %d", pl[i]);
      }
    printf("\n");
    }


int main() {
    char p[100][100];
    int lie = 0;
    int i, j, ol;
    char  k;

    while (scanf("%s", p[lie]) != EOF) {
        for (i = 0; i < 5; i++) {
            if (p[lie][i] >= '0' && p[lie][i] <= '9') {
                k = p[lie][i];
            }//算出最后一个数字==k
        }
        if (k == '1' || k == '6')j = 1;
        else 	if (k == '2' || k == '7')j = 2;
        else 	if (k == '3' || k == '8')j = 3;
        else  if (k == '4' || k == '9')j = 4;
        else if (k == '5' || k == '0')j = 5;
        opop(j);
        j = 0;
        lie++;
    }
}