每3A,1G,1I,1M,2R,1T组成一个pizza
将A总数/3,R总数/2,然后从A,G,I,M,R,T中找出最小值即为答案
#include<stdio.h>
#include<string.h>
int min(int a, int b) {
return a>b?b:a;
}
int main(void)
{
char ch[650];
int T, a, g, i, m, r, t, min_alph;
scanf("%d", &T);
getchar();
while (T--) {
fgets(ch, 620, stdin);
a = g = i = m = r = t = 0;
for (int j = 0; j < strlen(ch); j++) {
switch (ch[j]) {
case 'A': a++;break;
case 'G': g++;break;
case 'I': i++;break;
case 'M': m++;break;
case 'R': r++;break;
case 'T': t++;break;
}
}
min_alph = min(a / 3, min(g, min(i, min(m, min(r/2, t)))));
printf("%d\n", min_alph);
}
return 0;
}