再次尝试

practices/c/level1/p01_runningLetter/allPrimes.c

@@ -0,0 +1,25 @@
+#include<stdio.h>
+#include<windows.h>
+#define boundry 80
+
+void move(int m);
+
+void main()
+{
+	for ( int i = 0;i < boundry;i++) {
+		move(i);
+	}
+	for (int i = boundry;i >= 0;i--) {
+		move(i);
+	}
+}
+
+void move(int m)
+{
+	Sleep(50);
+	system("cls");
+	for (int j = 0;j < m - 1;j++) {
+		printf(" ");
+	}
+	printf("R");
+}

practices/c/level1/p02_isPrime/isPrime.c

@@ -0,0 +1,36 @@
+#include<stdio.h>
+
+int main()
+{
+	long int i, j;
+
+	printf("Please input a number: \t");
+	scanf_s("%d", &i);
+
+	if (i == 2) {
+		printf("%d  is a Prime.", i);
+	}
+	else if (i == 1) {
+		printf("%d  is not a Prime.", i);
+	}
+	else {
+		j = 2;
+		while (i > j) {
+			if (i%j == 0) {
+				break;
+			}
+			else {
+				if (i == j + 1) {
+					printf("%d  is a Prime.", i);
+					break;
+				}
+				j++;
+
+			}
+		}
+
+		if (i > j + 1) {
+			printf("%d  is not a Prime.", i);
+		}
+	}
+}

practices/c/level1/p03_Diophantus/Diophantus.c

@@ -0,0 +1,16 @@
+#include<stdio.h>
+int main()
+{
+	int i, j, k, l;
+	for (i = 100;i < 1000;i++)
+	{
+		k = i % 10;
+		j = (i % 100) / 10;
+		l = i / 100;
+		if (i == (k*k*k) + (j*j*j) + (l*l*l))
+		{
+			printf("%5d", i);
+		}
+	}
+	return 0;
+}

practices/c/level1/p04_ narcissus/narcissus.c

@@ -0,0 +1,17 @@
+#include<stdio.h>
+
+void main()
+{
+	int one, ten, hun;
+
+	for (int num= 100;num < 1000;num++)
+	{
+		one = num % 10;
+		ten = (num % 100) / 10;
+		hun = num / 100;
+		if (num == (one*one*one) + (ten*ten*ten) + (hun*hun*hun))
+		{
+			printf("%5d", num);
+		}
+	}
+}

practices/c/level1/p05_allPrimes/allPrimes.c

@@ -0,0 +1,23 @@
+#include<stdio.h>
+
+int main()
+{
+	printf("     2");
+	for (int i = 2;i <= 1000;i++)
+	{
+		int j = 2;
+		while (i > j) {
+			if (i%j == 0) {
+				break;
+			}
+			else {
+				if (i == j + 1) {
+					printf("%5d", i);
+					break;
+				}
+				j++;
+
+			}
+		}
+	}
+}

practices/c/level1/p06_Goldbach/Godback.c

@@ -0,0 +1,40 @@
+#include<stdio.h>;
+
+void main()
+{
+	int  t = 1, m, n;
+	int num[101] = { 0 };
+	int prime[26];
+
+	for (int a = 2;a <= 10;a++) {
+		if (num[a] == 0) {
+			for (int b = 2 * a;b <= 100;b += a)
+				num[b] = 1;
+		}
+	}
+
+	for (int a = 2;a <= 100;a++) {
+		if (num[a] == 0) {
+			prime[t] = a;
+			t += 1;
+		}
+	}
+
+	for (m = 1;m <= 50;m++) {
+		n = 2 * m;        //n��ʾ100���ڵ�ż����
+		for (int p = 1;p <= 26;p++) {
+			for (int d = 1;d <= p;d++) {
+				if (n == prime[p] + prime[d])
+					printf("%2d=%2d+%2d\t", n, prime[p], prime[d]);
+			}
+		}
+	}
+	printf("\n\n");
+
+	if (m = 50) {
+		printf("��ˣ���100���ڸ�°ͺղ�����ȷ��");
+	}
+	else {
+		printf("��ˣ���100���ڸ�°ͺղ��벻��ȷ��");
+	}
+}

practices/c/level1/p07_encrypt_decrypt/encrypt_decrypt.c

@@ -0,0 +1,68 @@
+#include<stdio.h>
+#include<stdlib.h>
+void encrypt();
+void decrypt();
+
+int L = 5;
+char k, ch;
+char* p;
+int count = 0;
+
+int main()
+{
+	p = (char*)malloc(sizeof(char) * L);
+	printf("��ѡ����������ܻ��ǽ���:a������     b������\n");
+	k = getch();
+	if (k == 'a') {
+		encrypt();
+	}
+
+
+	else if (k == 'b') {
+		decrypt();
+	}
+	else {
+		printf("���������Ϣ����.");
+		return 0;
+	}
+}
+
+
+void encrypt()
+{
+	printf("������������ܵ��ַ���: ");
+	do
+	{
+		ch = getchar();
+		count++;
+		if (count >= L) {
+			p = (char*)realloc(p, sizeof(char*) * (++L));
+		}
+		p[count - 1] = (char)((int)ch + 4);
+	} while (ch != '\n');
+	printf("��һ������%d���ַ�\n���ܺ������Ϊ��", count - 1);
+	for (int i = 0;i < count;i++) {
+		printf("%c", p[i]);
+	}
+	free(p);
+}
+
+
+void decrypt()
+{
+	printf("������������ܵ��ַ���: ");
+	do
+	{
+		ch = getchar();
+		count++;
+		if (count >= L) {
+			p = (char*)realloc(p, sizeof(char*) * (++L));
+		}
+		p[count - 1] = (char)((int)ch - 4);
+	} while (ch != '\n');
+	printf("��һ������%d���ַ�\n���ܺ������Ϊ��", count - 1);
+	for (int i = 0;i < count;i++) {
+		printf("%c", p[i]);
+	}
+	free(p);
+}

practices/c/level1/p08_hanoi/hanoi.c

@@ -0,0 +1,28 @@
+#include<stdio.h>
+#include<windows.h>
+void gotoxy(int x, int y);
+
+int main()
+{
+	boundry();
+
+}
+
+void boundry()
+{
+	gotoxy(20, 20);
+	printf("1");
+	gotoxy(20, 22);
+	printf("2");
+	gotoxy(20, 24);
+	printf("3");
+	gotoxy(20, 26);
+	printf("4");
+}
+void gotoxy(int x, int y)//ָ光标控制函数
+{
+	COORD c;
+	c.X = x;
+	c.Y = y;
+	SetConsoleCursorPosition(GetStdHandle(STD_OUTPUT_HANDLE), c);
+}

practices/c/level1/p09_maze/maze.c

@@ -0,0 +1,123 @@
+##define _CRT_SECURE_NO_WARNINGS//大神教的
+#include<stdio.h>
+#include<stdlib.h>
+
+void turn_up();
+void turn_down();
+void turn_left();
+void turn_right();
+void show();
+
+char map[22][22];
+int x = 20, y = 0;
+int point = 'R';
+
+int main()
+{
+	int i=0, j=0;
+	char *p;
+	char step;
+	p = map[0];
+	FILE *fp;
+	fp = fopen("mazemap.txt", "r");
+
+	if (fp == NULL) {
+		printf("can't open");
+		exit(1);
+	}
+
+	for (;p < map[0] + 484;p++) {
+		fscanf_s(fp, "%c", p);
+		if ((p - map[0]) % 22 == 0) {
+			i += 1;
+			j = 0;
+		}
+		j++;
+	}
+	map[x][y] = 'R';;
+	show();
+
+	while (x > 0 || y < 20) {
+		step = _getch();
+		switch (step) {
+		case 'w': {
+			turn_up();
+			break;
+		}
+		case 'a': {
+			turn_left();
+			break;
+		}
+		case 'd': {
+			turn_right();
+			break;
+		}
+		case 's': {
+			turn_down();
+			break;
+		}
+		}
+	}
+	system("cls");
+	printf("             That's  cool , you  have  win!\n");
+	getchar();
+}
+
+
+void show()
+{
+	for (int i = 0;i < 22;i++) {
+		for (int j = 0;j < 22;j++) {
+			printf("%c", map[i][j]);
+			if (j == 21)printf("\n");
+		}
+	}
+}
+
+
+void turn_up()
+{
+	if (map[x - 1][y] != '*') {
+		map[x][y] = ' ';
+		map[x - 1][y] = point;
+		system("cls");
+		show();
+		x = x - 1;
+	}
+}
+
+
+void turn_left()
+{
+	if (map[x][y - 1] != '*') {
+		map[x][y] = ' ';
+		map[x][y - 1] = point;
+		system("cls");
+		show();
+		y = y - 1;
+	}
+}
+
+
+void turn_right()
+{
+	if (map[x][y + 1] != '*') {
+		map[x][y] = ' ';
+		system("CLS");
+		map[x][y + 1] = point;
+		show();
+		y = y + 1;
+	}
+}
+
+
+void turn_down()
+{
+	if (map[x + 1][y] != '*') {
+		map[x][y] = ' ';
+		map[x + 1][y] = point;
+		system("cls");
+		show();
+		x += 1;
+	}
+}

practices/c/level1/p09_maze/mazemap.txt

@@ -0,0 +1 @@
+******************** **       **         * ** ***** *  *** ***** ** * *   ** * *       ** * ***  * * ***** **** * * ** * ***** *** ** *    * * ***** *** ** **** * * *   * *   **    * * *   * * ****** **** ******* *   * ** *            * *** ** *** ******** * *   ** *   *        * * **** * * ******** *   * **   *    *   * *** * ** * **** ***     * * ** *    *   * ***   * ***** ******* * * *** **          * * * *   ***** ******* * * *   *     *               ***********************