莫凯恩

level1/p01_runningLetter/Run.cpp

@@ -0,0 +1,38 @@
+#include<stdio.h>
+#include<stdlib.h>
+#include<windows.h>
+#include<time.h>
+
+#define WIDE 80
+#define SLEEP 5
+
+void Run(int i);
+
+int main()
+{
+	system("mode con cols=80 lines=30");
+	int i;
+	while(true)
+	{
+		for (i = 1; i < WIDE; i++)
+		{
+			Run(i);
+		}
+		for (i; i >= 0; i--)
+		{
+			Run(i);
+		}
+	}
+	return 0;
+}
+
+void Run(int i)
+{
+	for (int j = 0; j < i; j++)
+	{
+		printf(" ");
+	}
+	printf("R");
+	Sleep(SLEEP);
+	system("cls");
+}

level1/p02_isPrime/_isPrime.cpp

@@ -0,0 +1,35 @@
+#include <stdio.h>
+#include <stdlib.h>
+
+void NotPrime();
+
+int main()
+{
+	int i;
+	scanf("%d", &i);
+	if (i == 1)
+	{
+		NotPrime();
+	}
+	for (int n = 2; n*n <= i; n++)
+	{
+		if (i%n == 0)
+		{
+			NotPrime();
+			return 0;
+		}
+	}
+	printf("This is a Prime.");
+	system("pause");
+	return 0;
+}
+
+void NotPrime()
+{
+	printf("This is not a Prime!!!");
+	system("pause");
+<<<<<<< HEAD
+}
+=======
+}
+>>>>>>> 2b6d759c8e10cfe17d315e90703734d5f6ddb2ff

level1/p03_Diophantus/p03_Diophantus.cpp

@@ -0,0 +1,25 @@
+#include<stdio.h>
+#include<stdlib.h>
+
+double Form(double x);
+
+int main()
+{
+	double x = 10;
+	while (true)
+	{
+		if (Form(x) == x)
+		{
+			printf("Diophantus is %d years old when his son died.", (int)x-4);
+			system("pause");
+			return 0;
+		}
+		x++;
+	}
+}
+
+double Form(double x)
+{
+	double y = x / 6 + x / 12 + x / 7 + 5 + x / 2 + 4;
+	return y;
+}

level1/p04_ narcissus/p04_ narcissus.cpp

@@ -0,0 +1,32 @@
+#include <stdio.h>
+#include <stdlib.h>
+
+int Just(int x, int y, int z);
+
+int main()
+{
+	int i, j, k;
+	for (i = 1; i <= 9; i++)
+	{
+		for (j = 0; j <= 9; j++)
+		{
+			for (k = 0; k <= 9; k++)
+			{
+				if (Just(i, j, k) == i * 100 + j * 10 + k)
+				{
+					printf("%d ", i * 100 + j * 10 + k);
+				}
+				else if (i == 9 && j == 9 && k == 9)
+				{
+					system("pause");
+					return 0;
+				}
+			}
+		}
+	}
+}
+
+int Just(int x, int y, int z)
+{
+	return x * x*x + y * y*y + z * z*z;
+}

level1/p05_allPrimes/p05_allPrimes.cpp

@@ -0,0 +1,37 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <time.h>
+
+int main()
+{
+	clock_t start, end;
+	start = clock();
+	bool Prime[1001];
+	int i;
+	for (i = 1; i <= 1000; i++)
+	{
+		Prime[i] = true;
+	}
+	for (i = 2; i*i <= 1000; i++)
+	{
+		if (Prime[i])
+		{
+			for (int j = 2; j*i <= 1000; j++)
+			{
+				Prime[j*i] = false;
+			}
+		}
+	}
+	for (i = 2; i <= 1000; i++)
+	{
+		if (Prime[i])
+		{
+			printf("%d\n", i);
+		}
+	}
+	end = clock();
+	double duration = (double)(end - start) / CLOCKS_PER_SEC * 1000;
+	printf("Used %f ms", duration);
+	system("pause");
+	return 0;
+}

level1/p06_Goldbach/p06_Goldbach.cpp

@@ -0,0 +1,59 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+
+bool Pri[101];
+
+void FindPrime(void);
+
+int main()
+{
+	int n, i, j;
+	bool done;
+	FindPrime();
+	for (n = 4; n <= 100; n + 2)
+	{
+		done = false;
+		for (i = 2; i <= n / 2; i++)
+		{
+			if (Pri[i])
+			{
+				for (j = n - 2; j >= n / 2; j--)
+				{
+					if (Pri[j])
+					{
+						if (i + j == n)
+						{
+							printf("%d = %d + %d\n", n, i, j);
+							done = true;
+							break;
+						}
+					}
+				}
+			}
+			if (done)
+			{
+				n = n + 2;
+				break;
+			}
+		}
+	}
+	system("pause");
+	return 0;
+}
+
+void FindPrime(void)
+{
+	int i;
+	memset(Pri, 1, sizeof(bool) * 101);
+	for (i = 2; i*i <= 100; i++)
+	{
+		if (Pri[i])
+		{
+			for (int j = 2; i*j <= 100; j++)
+			{
+				Pri[i*j] = false;
+			}
+		}
+	}
+}

level1/p07_encrypt_decrypt/p07_encrypt_decrypt.cpp

@@ -0,0 +1,58 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <time.h>
+
+#define SEED 300
+
+int Encrypt(char *a);
+
+void Decrypt(int *b, int x);
+
+char a[128];
+
+int b[128];
+
+char c[128];
+
+int main()
+{
+	fgets(a, 128, stdin);
+	int seed = Encrypt(a);
+	printf("After encrypting:");
+	int len = strlen(a);
+	int i;
+	for (i = 0; i < len; i++)
+	{
+		printf("%d ", b[i]);
+	}
+	printf("\n");
+	Decrypt(b, seed);
+	printf("Now we decrypt it: %s\n", c);
+	system("pause");
+	return 0;
+}
+
+int Encrypt(char *a)
+{
+	int len = strlen(a) - 1;
+	srand(time(NULL));
+	int seed = rand();
+	int i = 0;
+	for (i = 0; i < len; i++)
+	{
+		b[i] = a[i] * (i + 1)*(seed % SEED);
+	}
+	return seed;
+}
+
+void Decrypt(int *b, int x)
+{
+	int len = strlen(a) - 1;
+	int i;
+	for (i = 0; i < len; i++)
+	{
+		c[i] = b[i] / (i + 1) / (x % SEED);
+	}
+	c[len + 1] = '\0';
+}

level1/p08_hanoi/p08_hanoi.cpp

@@ -0,0 +1,92 @@
+#include <stdio.h>
+#include <stdlib.h>
+
+char A = 'A';
+char B = 'B';
+char C = 'C';
+
+void Hanio(char t, int n, char *p);
+
+void SetPosition(char t, int n, char *p);
+
+int main()
+{
+	int n;
+	scanf("%d", &n);
+	char *p = (char*)malloc(sizeof(char)*n);
+	for (int i = 0; i < n; i++)
+	{
+		p[i] = A;
+	}
+	Hanio(C, n, p);
+	system("pause");
+	return 0;
+}
+
+void Hanio(char t, int n, char *p)
+{
+	if (n > 1)
+	{
+		SetPosition(t, n, p);
+	}
+	else
+	{
+		printf("No.%d %c -> %c\n", n, p[n - 1], t);
+		p[n - 1] = t;
+	}
+}
+
+void SetPosition(char t, int n, char *p)
+{
+	if (t == A)
+	{
+		if (p[n - 1] == B)
+		{
+			Hanio(C, n - 1, p);
+			printf("No.%d %c -> %c\n", n, p[n - 1], t);
+			p[n - 1] = t;			
+			Hanio(A, n - 1, p);
+		}
+		else
+		{
+			Hanio(B, n - 1, p);
+			printf("No.%d %c -> %c\n", n, p[n - 1], t);
+			p[n - 1] = t;
+			Hanio(A, n - 1, p);
+		}
+	}
+	else if (t == B)
+	{
+		if (p[n - 1] == A)
+		{
+			Hanio(C, n - 1, p);
+			printf("No.%d %c -> %c\n", n, p[n - 1], t);
+			p[n - 1] = t;
+			Hanio(B, n - 1, p);
+		}
+		else
+		{
+			Hanio(A, n - 1, p);
+			printf("No.%d %c -> %c\n", n, p[n - 1], t);
+			p[n - 1] = t;
+			Hanio(B, n - 1, p);
+		}
+	}
+	else if (t == C)
+	{
+		if (p[n - 1] == B)
+		{
+			Hanio(A, n - 1, p);
+			printf("No.%d %c -> %c\n", n, p[n - 1], t);
+			p[n - 1] = t;
+			Hanio(C, n - 1, p);
+		}
+		else
+		{
+			Hanio(B, n - 1, p);
+			printf("No.%d %c -> %c\n", n, p[n - 1], t);
+			p[n - 1] = t;
+			Hanio(C, n - 1, p);
+		}
+	}
+}