lvl1_1_to_8

practices/c/level1/p01_runningLetter/lvl1_1_Running_letter.c

@@ -0,0 +1,46 @@
+/* code:	Running Letter
+ * author:	Kyrios0
+ * date: 	2017.02.26
+ * state: 	finished
+ * version: 1.0.0
+ */
+
+#include<stdio.h>
+#include<windows.h>
+
+void gotoxy(int x, int y)
+{
+	HANDLE hOutput;
+	COORD coo;
+	coo.X = x;
+	coo.Y = y;
+	hOutput = GetStdHandle(STD_OUTPUT_HANDLE);
+	SetConsoleCursorPosition(hOutput, coo);
+}
+
+int main(int argc, char** argv)
+{
+	system("chcp 437");
+	system("color 0f");
+	system("mode con cols=63 lines=32");
+
+	int x = 0, y = 0, round = 0;
+
+	while(1)
+	{
+		system("cls");
+
+		gotoxy(x, y);
+		putchar('#');
+		gotoxy(x, y);
+
+		(round % 2 == 0) ? x++ : x--;
+		if((x == 0) || (x == 63))
+		{
+			round++;
+		}
+
+		Sleep(25);
+	}
+	return 0;
+}

practices/c/level1/p02_isPrime/lvl1_2_isPrime.c

@@ -0,0 +1,105 @@
+// isPrime.cpp
+//
+
+#include "stdafx.h"
+/* code:	Linked list Step0 for eratosthenes Prime (change from lvl1_5)
+ * author:	Kyrios0
+ * date: 	2017.02.21
+ * state: 	finished
+ * version: 1.0.2
+ */
+
+#include<stdio.h>
+#include<stdlib.h>//malloc()
+#include<string.h>
+#include<Windows.h>
+
+typedef struct linked {
+	int data;
+	linked *next;
+}linked;
+
+linked* creat(int length)
+{
+	linked *head, *tail, *p;
+	int x;
+	head = tail = NULL;
+
+	for (x = 0; x < length; x++)
+	{
+		p = (linked *)malloc(sizeof(linked));
+		p->data = x + 2;//0 and 1 aren't prime or composite number
+		p->next = NULL;
+
+		if (head == NULL)
+		{
+			head = tail = p;
+		}
+		else
+		{
+			tail = tail->next = p;
+		}
+	}
+
+	return head;
+}
+
+int main(int argc, char** argv)
+{
+	long len, userNumber, finalNumber = 2;
+
+	puts("Prime Number Detection System");
+	puts("Please enter the number you want to detect（It should be no less than 2）");
+	scanf("%ld", &userNumber);
+
+	len = userNumber;
+	linked *current, *head, *temp, *currenthead;
+	current = creat(len);
+	head = current;
+	currenthead = head;
+
+	puts("Working...");
+
+	for (long i = 0; ; i++)
+	{
+		if (i * i >= len)//Termination
+		{
+			break;
+		}
+
+		while (current->next != NULL)
+		{
+			temp = current->next;
+
+			while (temp->data % currenthead->data == 0)//Delete this number
+			{
+				current->next = temp->next;
+				temp = temp->next;
+				len--;
+				if (temp == NULL)
+				{
+					break;
+				}
+			}
+
+			if (current->next == NULL)
+			{
+				break;
+			}
+			else
+			{
+				current = current->next;
+			}
+		}
+
+		finalNumber = current->data;
+		currenthead = currenthead->next;
+		current = currenthead;
+	}
+
+	printf(((finalNumber == userNumber) || (userNumber == 2)) ? ("%d is a prime number\n") : ("%d is a composite number\n"), userNumber);
+
+	system("pause");
+
+	return 0;
+}

practices/c/level1/p03_Diophantus/README.md

@@ -14,4 +14,6 @@
 
 年级是他的一半。
 
-问儿子死时丢番图多大？
+问儿子死时丢番图多大？
+
+/* *just for test* */ 

practices/c/level1/p03_Diophantus/lvl1_3_Diophantus.c

@@ -0,0 +1,27 @@
+/* author:	Kyrios0
+ * date:	2017.02.23
+ * version:	1.0.0
+ * state:	finished
+ */
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <windows.h>
+
+int main(int argc, char *argv[]) {
+	system("chcp 437");
+	system("cls");
+	double age = 0.0, ans = 0.0;
+	while(1)
+	{
+		ans = (1.0/6.0 + 1.0/12.0 + 1.0/7.0 + 1.0/2.0) * age + 9.0;
+		if(ans - age < 0.1)
+		{
+			printf("He was %.0f years old at that time. \n", ans - 4);
+			system("pause");
+			return 0;
+		}
+		age += 1.0;
+	 } 
+	return 0;
+}

practices/c/level1/p04_ narcissus/README.md

@@ -4,4 +4,4 @@
 
 水仙花数：n位数的每个数位的n次方之和等于该n位数本身
 
-例如：153=1^3+5^3+3^3
+例如：153=1^3 + 5^3 + 3^3

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

@@ -0,0 +1,36 @@
+/* code:	Narcissus
+ * author:	Kyrios0
+ * date: 	2017.02.26
+ * state: 	finished
+ * version: 1.0.0
+ */ 
+
+#include "stdafx.h"
+#include<stdio.h>
+#include<windows.h>
+#include<math.h>
+
+int main(int argc, char** argv)
+{
+	system("chcp 437");
+	system("cls");
+	int hun, ten, one, sum = 100;//hun = 100
+	puts("The following is the number of narcissus in 1000");
+
+	while (sum < 1000)
+	{
+		one = sum % 10;
+		ten = sum / 10 % 10;
+		hun = sum / 100;
+
+		if ((int)(pow(double(one), 3.0) + pow(double(ten), 3.0) + pow(double(hun), 3.0)) == sum)
+		{
+			printf("%d\n", sum);
+		}
+
+		sum++;
+	}
+
+	system("pause");
+	return 0;
+}

practices/c/level1/p05_allPrimes/lvl1_5_allPrimes.c

@@ -0,0 +1,115 @@
+// allPrime.cpp
+//
+
+#include "stdafx.h"
+/* code: Linked list Step0 for eratosthenes
+ * author:	Kyrios0
+ * date: 	2017.02.21
+ * state: 	finished
+ * version: 	1.0.2
+ */
+
+#include<stdio.h>
+#include<stdlib.h>//malloc()
+#include<string.h>
+#include<Windows.h>
+
+typedef struct linked {
+	int data;
+	linked *next;
+}linked;
+
+linked* creat(int length)
+{
+	linked *head, *tail, *p;
+	int x;
+	head = tail = NULL;
+
+	for (x = 0; x < length; x++)
+	{
+		p = (linked *)malloc(sizeof(linked));
+		p->data = x + 2;//0 and 1 aren't prime or composite number
+		p->next = NULL;
+
+		if (head == NULL)
+		{
+			head = tail = p;
+		}	
+		else
+		{
+			tail = tail->next = p;
+		}	
+	}
+
+	return head;
+}
+
+
+
+int main(int argc, char** argv)
+{
+	long len = 10000000;//about 40s
+	linked *current, *head, *temp, *currenthead;
+	current = creat(len);
+	head = current;
+	currenthead = head;
+
+	puts("Working...");
+
+	for (long i = 0; ; i++)
+	{
+		if (i * i >= len)//Termination
+		{
+			break;
+		}
+
+		while (current->next != NULL)
+		{
+			temp = current->next;
+
+			while (temp->data % currenthead->data == 0)//Delete this number
+			{
+				current->next = temp->next;
+				temp = temp->next;
+				len--;
+				if (temp == NULL)
+				{
+					break;
+				}
+			}
+
+			if (current->next == NULL)
+			{
+				break;
+			}
+			else
+			{
+				current = current->next;
+			}
+		}
+
+		currenthead = currenthead->next;
+		current = currenthead;
+	}
+
+	FILE *fpt;
+	fpt = fopen("PrimeList.txt", "w");
+
+	puts("Start writing... Please wait a moment.");
+
+	for (int i = 0; i < len; i++)//output
+	{
+		fprintf(fpt, "%d, ", head->data);
+		head = head->next;
+		if ((i % 100000 == 0) && (i != 0))
+		{
+			printf("%d numbers has been writen: %d \n", i, head->data);
+		}
+	}
+
+	puts("DONE!");
+
+	system("pause");
+
+	return 0;
+}