交作业

Running letter

@@ -0,0 +1,37 @@
+#include<stdio.h>
+#include<windows.h>
+void running(int col);
+int main(void)
+{
+	system("mode con cols=63");
+	running(63);
+
+	return 0;
+} 
+void running(int col)
+{
+	int i,j;
+	while(1)
+	{
+		for(i=0;i<=col-1;i++)
+		{
+			Sleep(50);
+			system("cls");
+			for(j=0;j<i;j++)
+			{
+				printf(" ");
+			}
+			putchar('>');
+	        }
+		for(i=col-1;i>=0;i--)
+		{
+			Sleep(50);
+			system("cls");
+			for(j=0;j<i;j++)
+			{
+				printf(" ");
+			}
+			putchar('<');
+	        }	    
+	}
+}

practices/c/level1/p01_runningLetter/runningletter.c

@@ -0,0 +1,35 @@
+#include<stdio.h>
+#include<windows.h>
+#include<stdbool.h>
+
+void running(int col);
+
+int main(void){
+	system("mode con cols=63");
+	running(63);
+
+	return 0;
+} 
+void running(int col){
+	int i=0,j;
+	bool flag=0;
+
+	while(1){
+		Sleep(50);
+		system("cls");
+		for(j=0;j<i;j++){
+			printf(" ");
+		}
+		if(!flag){
+			i++;
+		}
+		else{
+			i--;
+		}
+		if(62==i||0==i){
+			flag=!flag;
+		}
+		putchar('R');
+
+	}
+}

practices/c/level1/p02_isPrime/is_prime.c

@@ -0,0 +1,35 @@
+#include<stdio.h>
+#include<math.h>
+
+int is_prime(int n);
+
+int main(void)
+{
+	int n;
+
+	scanf("%d",&n);
+	if(is_prime(n))
+	{
+		printf("%d is prime.\n",n);
+	}
+	else
+	{
+		printf("%d isn/'t prime.\n");
+	}
+
+	return 0;
+
+}
+int is_prime(int n)
+{
+	int i;
+
+	for(i=2;i<=pow(n,0.5);i++)
+	{
+		if(n%i==0)
+		{
+			return 0;
+		}
+	}
+	return 1;
+}

practices/c/level1/p03_Diophantus/Diophantus.c

@@ -0,0 +1,26 @@
+#include<stdio.h>
+#define rate 1/6.0+1/12.0+1/7.0
+
+void Diophantus(void);
+
+int main(void)
+{
+	Diophantus();
+	system("pause");
+
+	return 0;
+} 
+void Diophantus(void)
+{
+	int age_father=6;
+
+	while(age_father<=200)
+	{
+		if(age_father==(int)age_father*(rate+0.5)+9)
+		{
+			printf("%d\n",age_father-4);
+		}
+		age_father+=2;
+	}
+
+}

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

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

practices/c/level1/p05_allPrimes/allprimes.c

@@ -0,0 +1,40 @@
+#include<stdio.h>
+#include<time.h>
+#include<math.h>
+
+int is_prime(int n);
+void printprime(void);
+
+int main(void)
+{
+	printprime();
+
+	return 0;
+} 
+void printprime(void)
+{
+	int max,i;
+	float delta;
+
+	scanf("%d",&max);
+	delta=clock();
+	for(i=2;i<=max;i++)
+	{
+		if(is_prime(i))
+		{
+			printf("%d\t",i);
+		}
+	}
+	delta=clock()-delta;
+	printf("\nIt takes %.2f ms\n",delta);
+}
+int is_prime(int n)
+{
+	int j;
+
+	for(j=2;j<=pow(n,0.5);j++)
+	{
+		if(n%j==0)return 0;
+	}
+	return 1;
+}

practices/c/level1/p05_allPrimes/prime.c

@@ -0,0 +1,83 @@
+#include<stdio.h>
+#include<stdlib.h>
+typedef struct link_list
+{
+	long long int num;
+	struct link_list * next;
+}LINK;
+LINK * create(long long int n);
+void dele(LINK * head);
+void screen(LINK * head);
+void display(LINK * head);
+int main(void)
+{
+	long long int max;
+	LINK * _head; 
+	scanf("%lld",&max);
+	_head=create(max);
+
+	//screen(_head);
+	display(_head);
+
+	system("pause");
+	return 0;
+}
+LINK * create(long long int n)
+{
+	LINK *head,*cp1,*cp2;
+	long long int i;
+
+	head=NULL;
+	cp1=cp2=(LINK *)malloc(sizeof(LINK *));
+	for(i=2;i<=n;i++)
+	{
+		if(2==i)
+		{
+			head=cp1;
+		}
+		else
+		{
+			cp1->next=cp2;
+			cp1=cp2;
+		}
+		cp1->num=i;
+		cp2=(LINK *)malloc(sizeof(LINK *));
+	}
+	cp1->next=NULL;
+	free(cp2);
+
+	return head;
+}
+void screen(LINK * head)
+{
+	LINK *cp1,*cp2,*cp3,*temp;
+	cp1=cp2=cp3=head;
+	while(cp3!=NULL)
+	{
+		cp2=cp3;
+		cp1=cp3;
+		while(cp2!=NULL&&cp1!=NULL)
+		{
+			cp2=cp2->next;
+			if(cp2!=NULL&&0==cp2->num%cp3->num)
+			{
+				temp=cp2;
+				cp1->next=cp1->next->next;
+				cp2=cp2->next;
+			}
+			cp1=cp1->next;
+		}
+		cp3=cp3->next;
+	}
+}
+void display(LINK * head)
+{
+	LINK *cp;
+
+	cp=head;
+	while(cp!=NULL)
+	{
+		printf("%lld\t",cp->num);
+		cp=cp->next;
+	}
+} 

practices/c/level1/p06_Goldbach/Goldbach.c

@@ -0,0 +1,75 @@
+#include<stdio.h>
+#include<math.h>
+
+int is_prime(int n);
+int _prime(int *P);
+void Goldbach(int *P,int n);
+
+int main(void)
+{
+	int prime[100];
+	int max;
+
+	max=_prime(prime);
+    Goldbach(prime,max);
+
+    return 0;
+
+}
+void Goldbach(int *P,int n)
+{
+	int even=4;
+	int i,j;
+	int B;
+
+	while(even<=100)
+	{
+		B=0;
+		for(i=0;i<n;i++)
+		{
+			for(j=i;j<n;j++)
+			{
+				if(even==P[i]+P[j])
+				{
+					printf("%3d=%3d+%3d\n",even,P[i],P[j]);
+					even+=2;
+					B=1;
+					break;
+				}
+			}
+			if(B==1)
+			{
+				break;
+			} 
+		}
+	}
+	printf("100���ڵĸ�°ͺղ������!\n");
+	system("pause"); 
+}
+int _prime(int *P)
+{
+	int i,j=0;
+
+	for(i=2;i<=100;i++)
+	{
+		if(is_prime(i))
+		{
+			P[j]=i;
+			j++;
+		}
+	}
+	return j;
+}
+int is_prime(int n)
+{
+	int i;
+
+	for(i=2;i<=pow(n,0.5);i++)
+	{
+		if(n%i==0)
+		{
+			return 0;
+		}
+	}
+	return 1;
+}