niyyzf/obsidian
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

3

Browse Source
This commit is contained in:
whatisnot
2025-08-14 15:35:42 +08:00
parent 59d64954ed
commit d46218961a
3 changed files with 17 additions and 11 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
C/.idea/encodings.xml generated Normal file
View File

@ -0,0 +1,6 @@
<?xml version="1.0" encoding="UTF-8"?>
<project version="4">
<component name="Encoding">
<file url="file://$PROJECT_DIR$/T1/main.c" charset="GBK" />
</component>
</project>

22
C/T1/main.c
View File

@ -3,35 +3,35 @@
#include <stdlib.h> #include <stdlib.h>
bool canWinNim(int n) { bool canWinNim(int n) {
// 如果石头数量是4的倍数，先手必输 // <EFBFBD><EFBFBD><EFBFBD><EFBFBD>ʯͷ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>4<EFBFBD>ı<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ֱ<EFBFBD><EFBFBD><EFBFBD>
// 否则先手必胜 // <EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ֱ<EFBFBD>ʤ
return n % 4 != 0; return n % 4 != 0;
} }
int main(void) { int main(void) {
// 测试用例1: n = 4, 期望输出: false // <EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>1: n = 4, <EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>: false
int n1 = 4; int n1 = 4;
bool result1 = canWinNim(n1); bool result1 = canWinNim(n1);
printf("石头数量 %d: %s\n", n1, result1 ? "true (能赢)" : "false (不能赢)"); printf("ʯͷ<EFBFBD><EFBFBD><EFBFBD><EFBFBD> %d: %s\n", n1, result1 ? "true (<EFBFBD><EFBFBD>Ӯ)" : "false (<EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ӯ)");
// 测试用例2: n = 1, 期望输出: true // <EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>2: n = 1, <EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>: true
int n2 = 1; int n2 = 1;
bool result2 = canWinNim(n2); bool result2 = canWinNim(n2);
printf("石头数量 %d: %s\n", n2, result2 ? "true (能赢)" : "false (不能赢)"); printf("ʯͷ<EFBFBD><EFBFBD><EFBFBD><EFBFBD> %d: %s\n", n2, result2 ? "true (<EFBFBD><EFBFBD>Ӯ)" : "false (<EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ӯ)");
// 测试用例3: n = 2, 期望输出: true // <EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>3: n = 2, <EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>: true
int n3 = 2; int n3 = 2;
bool result3 = canWinNim(n3); bool result3 = canWinNim(n3);
printf("石头数量 %d: %s\n", n3, result3 ? "true (能赢)" : "false (不能赢)"); printf("ʯͷ<EFBFBD><EFBFBD><EFBFBD><EFBFBD> %d: %s\n", n3, result3 ? "true (<EFBFBD><EFBFBD>Ӯ)" : "false (<EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ӯ)");
// 额外测试用例 // <EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
int n4 = 3; int n4 = 3;
bool result4 = canWinNim(n4); bool result4 = canWinNim(n4);
printf("石头数量 %d: %s\n", n4, result4 ? "true (能赢)" : "false (不能赢)"); printf("ʯͷ<EFBFBD><EFBFBD><EFBFBD><EFBFBD> %d: %s\n", n4, result4 ? "true (<EFBFBD><EFBFBD>Ӯ)" : "false (<EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ӯ)");
int n5 = 5; int n5 = 5;
bool result5 = canWinNim(n5); bool result5 = canWinNim(n5);
printf("石头数量 %d: %s\n", n5, result5 ? "true (能赢)" : "false (不能赢)"); printf("ʯͷ<EFBFBD><EFBFBD><EFBFBD><EFBFBD> %d: %s\n", n5, result5 ? "true (<EFBFBD><EFBFBD>Ӯ)" : "false (<EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ӯ)");
return 0; return 0;
} }

BIN
C/main.exe
View File

Binary file not shown.