baoshuo/202401-programming-assignments
1
0
Fork 0
mirror of https://github.com/renbaoshuo/202401-programming-assignments.git synced 2024-11-23 15:48:42 +00:00
Code

【额外练习】选择结构

Browse Source
This commit is contained in:
Baoshuo Ren 2024-11-08 23:21:29 +08:00
parent 57684ccd22
commit aabd2bca7b
Failed to extract signature
1 changed files with 48 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

48
【额外练习】选择结构/7-58 选择-汉笨笨拜师3.c Normal file
View File

@ -0,0 +1,48 @@
#include <stdio.h>
#include <string.h>
char a[3], b[3];
int main() {
scanf("%s%s", a, b);
if (a[0] == 'J') {
strcpy(a, "11");
} else if (a[0] == 'Q') {
strcpy(a, "12");
} else if (a[0] == 'K') {
strcpy(a, "13");
} else if (a[0] == 'A') {
strcpy(a, "14");
} else if (a[0] == '2') {
strcpy(a, "15");
}
if (b[0] == 'J') {
strcpy(b, "11");
} else if (b[0] == 'Q') {
strcpy(b, "12");
} else if (b[0] == 'K') {
strcpy(b, "13");
} else if (b[0] == 'A') {
strcpy(b, "14");
} else if (b[0] == '2') {
strcpy(b, "15");
}
int a1 = a[0] - '0', a2 = a[1] - '0';
int b1 = b[0] - '0', b2 = b[1] - '0';
int a0 = a2 * 10 + a1;
int b0 = b2 * 10 + b1;
if (a0 == b0) {
printf("No winner\n");
} else if (a0 > b0) {
printf("Alice win\n");
} else { // a0 < b0
printf("Bob win\n");
}
return 0;
}