#include #include #define rep(i, n) for (i = 0; i < n; i++) #define min(a, b) (a < b ? a : b) #define inf 1145141919 int main() { char *good = "good"; char *problem = "problem"; int i, j, t; scanf("%d", &t); rep(i, t) { char s[101]; scanf("%s", s); int len = strlen(s); int top1 = 0, top2 = len - 7; int ans = inf; while (top1 <= len - 11) { int t1 = 0, t2 = 0; rep(j, 4) if (s[top1 + j] != good[j]) t1++; rep(j, 7) if (s[top2 + j] != problem[j]) t2++; ans = min(ans, t1 + t2); if (top1 + 4 == top2) { top1++; top2 = len - 7; } else top2--; } printf("%d\n", ans); } return 0; }