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[300];
scanf("%s",a);
scanf("%d",&k);
int len = strlen(a);
num = len + k;
num /= 2;
flag = 0;
for(n = num; n > 0; --n){
for(j = 0; 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 = 1;
break;
}
}
if(flag)    break;
}
printf("%d\n",n * 2);
return 0;
}