#include<stdio.h>
main()
{
char cards[20][5];
char a[4], b[4], c[4];
int i, j, k, n , e, q;
char t;
while (1) {
for (n = 0, t=getchar(); t!= '\n'&&t!=EOF; n++,t=getchar()) {
cards[n][0] = t;
scanf("%s", &cards[n][1]);
getchar();
}
q = 0;
if (n != 0) {
printf("CARDS: ");
for (i = 0; i < n; i++)
printf(" %s", cards[i]);
printf("\n");
}
for (i = 0; i < n; i++) {
for (j = i+1; j < n; j++)
for (k = j+1; k < n; k++) {
for (e = 0; e < 4; e++) {
if (!((cards[i][e] == cards[j][e] && cards[j][e] == cards[k][e])
|| (cards[i][e] != cards[j][e] && cards[i][e] != cards[k][e] && cards[j][e] != cards[k][e])))
break;
}
if (e == 4) {
if (q == 0)
printf("SETS: %d. %s %s %s\n", ++q, cards[i], cards[j], cards[k]);
else
printf(" %d. %s %s %s\n", ++q, cards[i], cards[j], cards[k]);
}
}
}
if (q == 0 && n!=0)
printf("SETS: *** None Found ***\n");
if (n != 0)
printf("\n");
if (t == EOF)
break;
}
}
POJ-1053
最新推荐文章于 2020-01-16 19:36:50 发布