Codeforces Round #253 (Div. 2), problem: (B)【字符串匹配】

简易字符串匹配，题意不难

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

 int main(){
     int i, j, k, t, n;
     int num, flag, ans;
     char a[];
     scanf("%s",a);
     scanf("%d",&k);
     int len = strlen(a);
     num = len + k;
     num /= ;
     flag = ;
     for(n = num; n > ; --n){
         for(j = ; j < len; ++j){
             i = j;
             while(i < j + n && i <(len + k - n)){
                 if((i + n) >= len){
                     ++i;
                     continue;
                 }
                 if(a[i] == a[i + n]){
                     ++i;
                     continue;
                 }
                 else    break;
             }

             if(i == j + n){
                 flag = ;
                 break;
             }
         }
         if(flag)    break;
     }
     printf("%d\n",n * );
     return ;
 }