Finish all include the FIGHTERS.

practices/c/level1/p01_runningLetter/runningLetter.c

@@ -0,0 +1,32 @@
+#include<stdio.h>
+#include<Windows.h>
+
+int main()
+{
+	int n = 0, pos=0;
+
+	while (TRUE)
+	{
+		if (n>30)
+		{
+			pos = 60 - n;
+		}
+		else
+		{
+			pos = n;
+		}
+		for (int i = 0; i<pos; i++)
+		{
+			putchar(' ');
+		}
+		putchar('R');
+		n++;
+		if (n == 60)
+		{
+			n = 0;
+		}
+		Sleep(50);
+		system("cls");
+	}
+	return 0;
+}

practices/c/level1/p02_isPrime/isPrime.c

@@ -0,0 +1,19 @@
+#include<stdio.h>
+#include<math.h>
+
+int main()
+{
+    int n,n_sqrt;
+    scanf("%d",&n);
+    n_sqrt=sqrt(n);
+    for(int i=2;i<n_sqrt;i++)
+    {
+        if(n%i==0)
+        {
+            printf("No");
+            return 0; 
+        }
+    }
+    printf("Yes");
+    return 0;
+}

practices/c/level1/p03_Diophantus/Diophantus.c

@@ -0,0 +1,15 @@
+#include<stdio>
+
+int main()
+{
+    int i=0;
+    while(++i)
+    {
+        if((i/12.0+i/6.0+i/7.0+5.0+i/2.0+4.0)==i)
+        {
+            printf("\n%d",i-4);
+            break;
+        }
+    }
+    return 0;
+}

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

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

practices/c/level1/p05_allPrimes/allPrimes.c

@@ -0,0 +1,34 @@
+#include<stdio.h>
+
+int main()
+{
+    int a[999];
+    for(int i=0;i<999;i++)
+    {
+        a[i]=i+2;
+    }
+    for(int i=0;i<999;i++)
+    {
+        for(int j=i;j<999;j++)
+        {
+            int n=(i+2)*(j+2);
+            if(n<=1000)
+            {
+                a[n-2]=0;
+            }
+            else
+            {
+                break;
+            }
+        }
+    }
+    for(int i=0;i<999;i++)
+    {
+        if(a[i]!=0)
+        {
+            printf("%4d",a[i]);
+        }
+    }
+
+    return 0;
+}

practices/c/level1/p06_Goldbach/Goldbach.c

@@ -0,0 +1,42 @@
+#include<stdio.h>
+#include<math.h>
+
+int isPrime(int n)
+{
+    int n_sqrt=sqrt(n);
+    for(int i=2;i<n_sqrt;i++)
+    {
+        if(n%i==0)
+        {
+            return 0;   //0 as false.
+        }
+    }
+    return 1;   //1 as true.
+}
+
+int count=0;
+
+int main()
+{
+    for(int i=4;i<=100;i+=2)
+    {
+        for(int j=2;j<i;j++)
+        {
+            if(isPrime(i-j)&&isPrime(j))
+            {
+                count++;
+                break;
+            }
+        }
+    }
+    if(count!=49)
+    {
+        printf("False");
+    }
+    else
+    {
+        printf("True");
+    }
+
+    return 0;
+}

practices/c/level1/p07_encrypt_decrypt/encrypt_decrypt.c

@@ -0,0 +1,52 @@
+#include <stdio.h>
+
+void encrypt(char*);
+void decrypt(char*);
+
+int main() 
+{
+	char a[10000];
+    char choice;
+	printf("D:decrypt E:encrypt\n");
+    scanf("%c",&choice);
+    if(choice=='D'||choice=='d')
+    {
+        printf("Text:");
+        scanf("%s",a);
+        encrypt(a);
+        printf("%s\n",a);
+    }
+	else if(choice=='E'||choice=='e')
+    {
+        printf("Encrypted text:");
+        scanf("%s",a);
+        decrypt(a);
+        printf("%s\n",a);
+    }
+    else
+    {
+        printf("Wrong input.");
+    }
+}
+
+void encrypt(char* str)
+{
+    char *ch=str;
+    while(*ch!='\0')
+    {
+        *(ch)^='#';
+        ++*(ch);
+        ++ch;
+    }
+}
+
+void decrypt(char* str)
+{
+    char *ch=str;
+    while(*ch!='\0')
+    {
+        --*(ch);
+        *(ch)^='#';
+        ++ch;
+    }
+}

practices/c/level1/p08_hanoi/hanoi.c

@@ -0,0 +1,23 @@
+#include<stdio.h>
+
+void hanoi(char,char,char,int);
+
+int main()
+{
+    hanoi('A','B','C',64);
+    return 0;
+}
+
+void hanoi(char source,char temp,char target,int number)
+{
+    if(number==1)
+    {
+        printf("move from %c to %c\n",source,target);
+    }
+    else
+    {
+        hanoi(source,target,temp,number-1);
+        hanoi(source,temp,target,1);
+        hanoi(temp,source,target,number-1);
+    }
+}

practices/c/level1/p09_maze/maze.c

@@ -0,0 +1,93 @@
+#include<stdio.h>
+#include<Windows.h>
+
+char map[11][12]=
+{
+	"OOOOOOOOOOO",
+	"OKO   O   O",
+	"O O O O O O",
+	"O   O O O O",
+	"OOOOO O O O",
+	"O       O O",
+	"O OOOOOOO O",
+	"O O   OO  O",
+	"O O O OOOOO",
+	"O   O      ",
+	"OOOOOOOOOOO"
+};
+int x=1;
+int y=1;
+
+void print();
+
+int main()
+{
+	print();
+	while (true)
+	{
+		if (GetKeyState(VK_DOWN) < 0)
+		{
+			if (map[y+1][x] == ' ')
+			{
+				map[y][x] = ' ';
+				y += 1;
+				map[y][x] = 'K';
+				print();
+			}
+			Sleep(100);
+		}
+		if (GetKeyState(VK_UP) < 0)
+		{
+			if (map[y -1][x] == ' ')
+			{
+				map[y][x] = ' ';
+				y -= 1;
+				map[y][x] = 'K';
+				print();
+			}
+			Sleep(100);
+		}
+		if (GetKeyState(VK_RIGHT) < 0)
+		{
+			if (map[y ][x+1] == ' ')
+			{
+				map[y][x] = ' ';
+				x += 1;
+				map[y][x] = 'K';
+				print();
+			}
+			Sleep(100);
+		}
+		if (GetKeyState(VK_LEFT) < 0)
+		{
+			if (map[y ][x-1] == ' ')
+			{
+				map[y][x] = ' ';
+				x-=1;
+				map[y][x] = 'K';
+				print();
+			}
+			Sleep(100);
+		}
+
+		if (x == 10 && y == 9)
+		{
+			system("cls");
+			printf("You win!\n");
+			Sleep(1000);
+			break;
+		}
+	}
+	return 0;
+}
+
+void print()
+{
+	system("cls");
+	for (int i = 0; i < 11; i++)
+	{
+		printf("%s\n", map[i]);
+	}
+}
+
+