曹思瀚

level1/p01_running_letter/main.c

@@ -1,6 +1,60 @@
-#include <printf.h>
+#include <stdio.h>
+#include <windows.h>
+
+#define RIGHT 00
+#define LEFT  1
+
+
+HANDLE hd;
+int width,dir=RIGHT;
+void move(int x,int y)
+{
+    COORD pos={x,y};
+    SetConsoleCursorPosition(hd,pos);
+    return;
+}
+void GetSize()
+{
+    CONSOLE_SCREEN_BUFFER_INFO info;
+    GetConsoleScreenBufferInfo(hd,&info);
+    width=info.srWindow.Right;
+    return;
+}
+int ne(int now)
+{
+    if(dir==RIGHT)
+    {
+        if(now!=width) return now+1;
+        else
+        {
+            dir=LEFT;
+            return now-1;
+        }
+    }
+    else
+    {
+        if(now) return now-1;
+        else
+        {
+            dir=RIGHT;
+            return now+1;
+        }
+    }
+}
 
 int main() {
-    printf("hello world!\n");
+    int now;
+    hd= GetStdHandle(STD_OUTPUT_HANDLE);
+    GetSize();
+    printf("a");
+    while(1)
+    {
+        move(now,0);
+        printf(" ");
+        now=ne(now);
+        move(now,0);
+        printf("a");
+        Sleep(25);
+    }
     return 0;
 }

level1/p02_is_prime/main.c

@@ -1,6 +1,27 @@
-#include <printf.h>
-
-int main() {
-    printf("hello world!\n");
+#include<stdio.h>
+int main()
+{
+    int m,n;
+    int i;
+    int cnt=0;
+    int sum=0;
+    scanf("%d %d",&m,&n);
+    if(m==1){
+        m=2;}
+    for(i=m;i<=n;i++){
+        int isprime=1;
+        int k;
+        for(k=2;k<i-1;k++){
+            if(i%k==0){
+                isprime=0;
+                break;
+            }
+        }
+        if(isprime){
+            cnt++;
+            sum+=i;
+        }
+    }
+    printf("%d %d\n",cnt,sum);
     return 0;
 }

level1/p03_all_primes/main.c

@@ -1,6 +1,55 @@
-#include <printf.h>
+#include <stdio.h>
 
 int main() {
-    printf("hello world!\n");
+    int i,x,cnt,num=0;
+    int a[100];
+    for(i=2;i<=100;i++){
+        cnt=0;
+        for(x=2;x<=i;x++){
+            cnt++;
+            if(i%x==0){
+                break;
+            }
+        }
+        if(cnt==i-1) {
+            printf("%d\n", i);
+            num++;
+            a[num-1]=i;
+        }
+        else
+            continue;
+    }
+    printf("num=%d\n",num);
+    int t,k,j,m,n,CNT=0;
+    for(t=6;t<=100;t++){
+        // printf("%d->%d\n",t,CNT);
+        for(i=0;i<num;i++){
+            if(a[i]<t){
+                k=t-a[i];
+                for(j=0;j<num;j++){
+                    m=k-a[j];
+                    for(n=0;n<num;n++){
+                        if(a[n]==m){
+                            CNT++;
+                            goto end;
+                        }else{
+                            continue;
+                        }
+
+                    }
+
+                }
+            }
+            else{
+                break;
+            }
+        }
+        end:continue;
+    }
+    printf("CNT=%d\n",CNT);
+    if(CNT==95){
+        printf("right");
+    }
+
     return 0;
 }

level1/p04_goldbach/main.c

@@ -1,6 +1,55 @@
-#include <printf.h>
+#include <stdio.h>
 
 int main() {
-    printf("hello world!\n");
+    int i,x,cnt,num=0;
+    int a[100];
+    for(i=2;i<=100;i++){
+        cnt=0;
+        for(x=2;x<=i;x++){
+            cnt++;
+            if(i%x==0){
+                break;
+            }
+        }
+        if(cnt==i-1) {
+            printf("%d\n", i);
+            num++;
+            a[num-1]=i;
+        }
+        else
+            continue;
+    }
+    printf("num=%d\n",num);
+    int t,k,j,m,n,CNT=0;
+    for(t=6;t<=100;t++){
+        // printf("%d->%d\n",t,CNT);
+        for(i=0;i<num;i++){
+            if(a[i]<t){
+                k=t-a[i];
+                for(j=0;j<num;j++){
+                    m=k-a[j];
+                    for(n=0;n<num;n++){
+                        if(a[n]==m){
+                            CNT++;
+                            goto end;
+                        }else{
+                            continue;
+                        }
+
+                    }
+
+                }
+            }
+            else{
+                break;
+            }
+        }
+        end:continue;
+    }
+    printf("CNT=%d\n",CNT);
+    if(CNT==95){
+        printf("right");
+    }
+
     return 0;
 }

level1/p05_encrypt_decrypt/main.c

@@ -1,6 +1,13 @@
-#include <printf.h>
-
-int main() {
-    printf("hello world!\n");
+#include<stdio.h>
+int main(){
+    char a[26];
+    a[0]='a';
+    int i,x;
+    i=1;
+    while(i<26){
+        a[i]=a[i-1]+1;
+    }
+    for(i=0;i<26;i++)
+    printf("%c",a[i]);
     return 0;
-}
+}

level1/p06_hanoi/main.c

@@ -1,6 +1,28 @@
-#include <printf.h>
+#include <stdio.h>
 
-int main() {
-    printf("hello world!\n");
-    return 0;
+//定义move函数，将一个盘子从x座移到y座上
+void move(char x, char y)
+{
+    printf("%c-->%c\n",x,y);   //输出移盘方案。x,y代表A，B，C座之一，根据每次的不同情况分别取A，B，C代入
+}
+
+void hanoi(int n, char one, char two, char three) //将n个盘从one座借助two座，移到three座
+{
+    if(n==1)
+        move(one, three);
+    else
+    {
+        hanoi(n-1, one, three, two); //将 A 座上 n-1 个盘子移到 B 座上（借助 C）
+        move(one, three);//将 A 座上剩下的 1 个盘子移到 C 座上
+        hanoi(n-1, two, one, three);//将 B 座上 n-1 个盘子移到 C 座上（借助 A）
+    }
+}
+
+main()
+{
+    int m;
+    printf("input the number of disks:");
+    scanf("%d",&m);   //盘子的数量
+    printf("The step to moving %d disks:\n",m);
+    hanoi(m,'A','B','C');
 }