Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
41 commits
Select commit Hold shift + click to select a range
89ed244
第一次提交
ifelseSorato Sep 12, 2023
fb85044
第一次提交
ifelseSorato Sep 12, 2023
b1fccb0
第一次提交
ifelseSorato Sep 13, 2023
e021bb2
Update main.c
ifelseSorato Sep 13, 2023
5b14a85
Update main.c
ifelseSorato Sep 13, 2023
39c1774
第二次提交
ifelseSorato Sep 13, 2023
2d364da
Update main.c
ifelseSorato Sep 13, 2023
20f42b8
Merge remote-tracking branch 'origin/main'
ifelseSorato Sep 13, 2023
df3ecde
Update main.c
ifelseSorato Sep 14, 2023
a5db44a
时间函数改进
ifelseSorato Sep 16, 2023
ba27ef9
Update main.c
ifelseSorato Sep 16, 2023
1a39665
Update main.c
ifelseSorato Sep 16, 2023
7b376ff
改进算法
ifelseSorato Sep 20, 2023
66062a2
Update main.c
ifelseSorato Sep 20, 2023
dc2b2e6
Update main.c
ifelseSorato Sep 22, 2023
8ee495e
Update main.c
ifelseSorato Sep 25, 2023
42b9e37
Update main.c
ifelseSorato Sep 25, 2023
61bf020
改进算法
ifelseSorato Sep 26, 2023
5926716
改进算法
ifelseSorato Sep 26, 2023
d28de6f
Merge remote-tracking branch 'origin/main'
ifelseSorato Sep 26, 2023
01c75f4
改进算法
ifelseSorato Oct 2, 2023
12ea5f9
改进算法
ifelseSorato Oct 8, 2023
efaa76e
Update CMakeLists.txt
ifelseSorato Nov 21, 2023
61c88cc
Update main.c
ifelseSorato Nov 21, 2023
1d5371f
Update main.c
ifelseSorato Nov 21, 2023
298c01f
Update CMakeLists.txt
ifelseSorato Nov 21, 2023
de44ca3
Update main.c
ifelseSorato Nov 21, 2023
ff66357
Create map.txt
ifelseSorato Nov 21, 2023
4704ef3
Create map1.txt
ifelseSorato Nov 21, 2023
f6653f4
Create map2.txt
ifelseSorato Nov 21, 2023
657e4f9
Update map1.txt
ifelseSorato Nov 21, 2023
35d6908
Update map2.txt
ifelseSorato Nov 21, 2023
a93f687
Update main.c
ifelseSorato Nov 21, 2023
a0c99e6
Update main.c
ifelseSorato Nov 21, 2023
4ce5909
Update CMakeLists.txt
ifelseSorato Dec 15, 2023
eae6726
Update main.c
ifelseSorato Dec 15, 2023
a6156d6
Update main.c
ifelseSorato Dec 15, 2023
b62fc2e
Add files via upload
ifelseSorato Dec 15, 2023
3378dd9
Add files via upload
ifelseSorato Dec 26, 2023
1e7e6ab
Update main.c
ifelseSorato Dec 28, 2023
45ec60e
Add files via upload
ifelseSorato Jan 4, 2024
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Binary file added AI五子棋实验报告.docx
Binary file not shown.
533 changes: 533 additions & 0 deletions aigo.c

Large diffs are not rendered by default.

Binary file added aigobang2.exe
Binary file not shown.
22 changes: 16 additions & 6 deletions level1/CMakeLists.txt
Original file line number Diff line number Diff line change
@@ -1,21 +1,31 @@
project(level1)

add_executable(p01_running_letter p01_running_letter/main.c)

add_executable(p02_is_prime p02_is_prime/main.c)
add_executable(p01_running_letter p01_running_letter/main.c
)

add_executable(p03_all_primes p03_all_primes/main.c)
add_executable(p02_is_prime p02_is_prime/main.c

add_executable(p04_goldbach p04_goldbach/main.c)
p02_is_prime/isprime.c
)

add_executable(p03_all_primes p03_all_primes/main.c
p03_all_primes/isprime2.c
p03_all_primes/isprime2.h)

add_executable(p04_goldbach p04_goldbach/main.c
p04_goldbach/isprime3.c
p04_goldbach/isprime3.h)

add_executable(p05_encrypt_decrypt p05_encrypt_decrypt/main.c)

add_executable(p06_hanoi p06_hanoi/main.c)

add_executable(p07_maze p07_maze/main.c)
add_executable(p07_maze p07_maze/main.c )

add_executable(p08_push_boxes p08_push_boxes/main.c)

add_executable(p09_linked_list p09_linked_list/main.c)

add_executable(p10_warehouse p10_warehouse/main.c)
add_executable(p10_warehouse p10_warehouse/main.c)

35 changes: 31 additions & 4 deletions level1/p01_running_letter/main.c
Original file line number Diff line number Diff line change
@@ -1,6 +1,33 @@
#include <printf.h>

#include <stdio.h>
#include<stdlib.h>
#include<time.h>
#include<string.h>
#include<windows.h>
#define N 40
int main() {
printf("hello world!\n");
int i,j,k;
char str[N];
printf("请输入一串字符串:");
gets(str);
for(i=1;i<50;i++)
{
for(j=0;j<i;j++)
{
printf(" ");
}
printf("%s",str);
Sleep(100);
system("cls");
}
for(i=50;i>1;i--)
{
for(k=0;k<i;k++)
{
printf(" ");
}
printf("%s",str);
Sleep(100);
system("cls");
}
return 0;
}
}
14 changes: 14 additions & 0 deletions level1/p02_is_prime/isprime.c
Original file line number Diff line number Diff line change
@@ -0,0 +1,14 @@
//
// Created by 86182 on 2023/9/26.
//
int isprime(int x)
{int ret=1;
int i;
for(i=3;i<x;i++){
if(x%i==0){
ret =0;
break;
}
}
return ret;
}
8 changes: 8 additions & 0 deletions level1/p02_is_prime/isprime.h
Original file line number Diff line number Diff line change
@@ -0,0 +1,8 @@
//
// Created by 86182 on 2023/9/26.
//

#ifndef C2023_CHALLENGE_ISPRIME_H
#define C2023_CHALLENGE_ISPRIME_H
int isprime(int x);
#endif //C2023_CHALLENGE_ISPRIME_H
17 changes: 12 additions & 5 deletions level1/p02_is_prime/main.c
Original file line number Diff line number Diff line change
@@ -1,6 +1,13 @@
#include <printf.h>

int main() {
printf("hello world!\n");
#include<stdio.h>
#include"isprime.h"
int isprime(int x);
int main(){
int x;
scanf("%d",&x);
if (isprime(x)) {
printf("是素数");
}else{
printf("不是素数");
}
return 0;
}
}
20 changes: 20 additions & 0 deletions level1/p03_all_primes/isprime2.c
Original file line number Diff line number Diff line change
@@ -0,0 +1,20 @@
//
// Created by 86182 on 2023/9/26.
//
//
// Created by 86182 on 2023/9/26.
//
#include<stdio.h>
int isprime(int x)
{int ret=1;
int i;
for(i=3;i<x;i+=2){
if(x%i==0){
ret =0;
break;
}
}
if(ret){
printf("%d\n",x);
}
}
8 changes: 8 additions & 0 deletions level1/p03_all_primes/isprime2.h
Original file line number Diff line number Diff line change
@@ -0,0 +1,8 @@
//
// Created by 86182 on 2023/9/26.
//

#ifndef C2023_CHALLENGE_ISPRIME2_H
#define C2023_CHALLENGE_ISPRIME2_H
int isprime(int x);
#endif //C2023_CHALLENGE_ISPRIME2_H
22 changes: 18 additions & 4 deletions level1/p03_all_primes/main.c
Original file line number Diff line number Diff line change
@@ -1,6 +1,20 @@
#include <printf.h>
#include<stdio.h>
#include<time.h>
#include"isprime2.h"
int main()
{
double start,last;
start=clock();
int first=3;
int end=1000;
int i,j;
printf("2\n");
for(i=first;i<end;i+=2)
{
isprime(i);
}

int main() {
printf("hello world!\n");
last=clock();
printf("��ʱ%fms",(last-start)/CLOCKS_PER_SEC);
return 0;
}
}
14 changes: 14 additions & 0 deletions level1/p04_goldbach/isprime3.c
Original file line number Diff line number Diff line change
@@ -0,0 +1,14 @@
//
// Created by 86182 on 2023/10/8.
//
int isprime(int x)
{int ret=1;
int i;
for(i=3;i<x;i++){
if(x%i==0){
ret =0;
break;
}
}
return ret;
}
8 changes: 8 additions & 0 deletions level1/p04_goldbach/isprime3.h
Original file line number Diff line number Diff line change
@@ -0,0 +1,8 @@
//
// Created by 86182 on 2023/10/8.
//

#ifndef C2023_CHALLENGE_ISPRIME3_H
#define C2023_CHALLENGE_ISPRIME3_H
int isprime(int x);
#endif //C2023_CHALLENGE_ISPRIME3_H
48 changes: 44 additions & 4 deletions level1/p04_goldbach/main.c
Original file line number Diff line number Diff line change
@@ -1,6 +1,46 @@
#include <printf.h>
#include<stdio.h>
#include"isprime3.h"
int main()
{int j;
int prime[1000]={2};
int m=1;
for(j=3;j<1000;j+=2)
{
if(isprime(j))
{
prime[m++]=j;
}
}
int x;
printf("����������һ��ż����");
scanf("%d",&x);
if(x>2&&x<=1000){
if(x%2==0)
{
int i;
for(i=0;prime[i]!=0;i++) {
int k = x - prime[i];
int l;
if (k <= prime[i]) {
for (l = 2; l < k; l++) {

}
if (k == l) {
printf("%d=%d+%d\n", x, prime[i], k);
}
}
}
}else{
printf("�ⲻ��һ��ż����");
}


}else if(x>1000)
{
printf("�������̫����!");
}else{
printf("�������̫С��");
}

int main() {
printf("hello world!\n");
return 0;
}
}
43 changes: 37 additions & 6 deletions level1/p05_encrypt_decrypt/main.c
Original file line number Diff line number Diff line change
@@ -1,6 +1,37 @@
#include <printf.h>

int main() {
printf("hello world!\n");
return 0;
}
#include<stdio.h>
#include<string.h>
#define N 52
void encode(char str[N],int n);
void decode(char str[N],int n);
int main()
{
char str[N];
int n;
printf("请输入一个字符串:");
gets(str);
printf("请输入要移位的数字密钥:");
scanf("%d",&n);
encode(str,n);
printf("加密后的密文:%s\n",str);
decode(str,n);
printf("解密后的明文:%s",str);
return 0;
}
void encode(char str[N],int n)
{int i;
for(i=0;i<strlen(str);i++)
{
str[i]+=n;
if(str[i]>'z'||str[i]>"Z")
str[i]-=26;
}
}
void decode(char str[N],int n)
{int i;
for(i=0;i<strlen(str);i++)
{
str[i]-=n;
if(str[i]>'z'||str[i]>"Z")
str[i]-=26;
}
}
25 changes: 21 additions & 4 deletions level1/p06_hanoi/main.c
Original file line number Diff line number Diff line change
@@ -1,6 +1,23 @@
#include <printf.h>

int main() {
printf("hello world!\n");
#include <stdio.h>
void hanoi(int n,char A,char B,char C);
int main()
{
int n;
char A,B,C;
printf("������ƽ�Բ�̵ĸ�����");
scanf("%d",&n);
hanoi( n, 'A', 'B', 'C');
return 0;
}
void hanoi(int n,char A,char B,char C)
{
if(n==1)
{
printf("%c->%c\n",A,C);

}else{
hanoi(n-1,A,C,B);
printf("%c->%c\n",A,C);
hanoi(n-1,B,A, C);
}
}
Loading