王瀚 second submission

homework2017.2.26/C-level1/p01_runningLetter.c

@@ -0,0 +1,30 @@
+#include<stdio.h>
+#include<stdlib.h>
+
+int main()
+{
+	const int LENGTH=80;
+	int lenNow=0,goBack=0,step;
+	while (1)
+	{
+		system("cls");
+		for (step=1;step<lenNow;step++){			
+			printf(" ");
+		}		
+		printf("R");
+		if (goBack){
+			lenNow--;
+		}		
+		else{
+			lenNow++;
+		}		
+		if (lenNow==LENGTH){
+			goBack=1;
+		}		
+		else if (lenNow==0){
+			goBack=0;
+		}		
+		sleep(50);
+	}
+	return 0;
+}

homework2017.2.26/C-level1/p02_isPrime.c

@@ -0,0 +1,22 @@
+#include<stdio.h>
+
+int main(){
+	int number,i;
+	while (scanf("%d",&number)!=EOF){	
+		if (number==0){
+			break;
+		}
+		for (i=2;i*i<=number;i++){
+			if (number%i==0){
+				break;
+			}
+		}
+		if (i*i>number){
+			printf("Yes\n");	
+		}
+		else{
+			printf("No\n");
+		}
+	}
+	return 0;
+}

homework2017.2.26/C-level1/p03_Diophantus.c

@@ -0,0 +1,12 @@
+#include<stdio.h>
+
+int main(){
+ 	int age=1;
+ 	while (age++){
+ 		if (age%6==0&&age%12==0&&age%7==0&&(age/2-age/6-age/12-age/7)==9)	{
+			break;
+		}	
+	}
+	printf("%d\n",age-4);
+	return 0;
+}

homework2017.2.26/C-level1/p04_narcissus.c

@@ -0,0 +1,15 @@
+#include<stdio.h>
+
+int main(){
+ 	int number;
+ 	int hundred,ten,one;
+ 	for (number=100;number<=999;number++){
+ 		hundred=number/100;
+ 		ten=(number/10)%10;
+ 		one=number%10;
+ 		if (number==hundred*hundred*hundred+ten*ten*ten+one*one*one){
+			printf("%d\n",number);
+		}
+	}
+	return 0;
+ }

homework2017.2.26/C-level1/p05_allPrimes.c

@@ -0,0 +1,27 @@
+#include<stdio.h>
+#include<string.h>
+#include<time.h>
+
+int main(){
+ 	int i,j=2,prime[1000],numb;
+ 	clock_t start,endd;
+	start=clock();
+	memset(prime,0,sizeof(prime));
+	prime[1]=2;
+ 	printf("%d\n",prime[1]);
+ 	for (numb=3;numb<=1000;numb++){
+ 		for (i=1;prime[i]*prime[i]<=numb&&prime[i];i++){
+			if (numb%prime[i]==0){
+				break;
+			}
+		}
+		if(prime[i]*prime[i]>numb){
+			prime[j++]=numb;
+		 	printf("%d\n",numb);
+		}
+	}
+	endd=clock();
+	printf("The algorithm costs %.0lfms;\n",(double)(endd-start));
+	printf("It will costs 0.01ms without printf().\n");
+ 	return 0;
+}

homework2017.2.26/C-level1/p06_Goldbach.c

@@ -0,0 +1,36 @@
+#include<stdio.h>
+
+int main(){
+  	int i,j=2,numb,prime[100];
+ 	prime[1]=2;
+ 	for (numb=3;numb<=100;numb++){
+ 		for (i=1;prime[i]*prime[i]<=numb&&prime[i];i++){
+			if (numb%prime[i]==0)	break;			
+		}
+		if(prime[i]*prime[i]>numb){
+			prime[j++]=numb;			
+		}
+	}
+	for (numb=4;numb<=100;numb+=2){
+		for (i=1;prime[i]!=0;i++){
+			for (j=1;prime[j]!=0;j++){
+				if (prime[j]+prime[i]==numb){
+					break;		
+				}			
+			}
+			if (prime[j]==0){
+				break;	
+			}
+		}
+		if (prime[i]==0&&prime[j]==0){
+			break;
+		}
+	}
+	if (numb>100){
+		printf("proved\n");
+	}
+	else{
+		printf("not");	
+	}
+	return 0;
+}

homework2017.2.26/C-level1/p07_encrypt_decrypt.c

@@ -0,0 +1,147 @@
+#include<stdio.h>
+#include<stdlib.h>
+#include<string.h>
+
+int Length,LastNum;
+long long a[100000],b[100000];
+long long p=158427067ll,q=358424749ll;
+long long e1=79,e2=718787103891511ll;
+long long n=56784181724281183ll;
+
+long long nextPrime(long long x);
+long long FORe2(long long  x);
+long long fastAdd(long long x,long long y);
+long long fastExp(long long x,long long y);
+void encrypt();
+void decrypt();
+
+int main(){
+	char ch;
+	int i=1,j=1;
+	while (scanf("%c",&ch)!=EOF){
+		if (ch=='\n') break;
+		if (j==4){
+			j=0;
+			i++;
+		}
+		a[i]<<=8;
+		a[i]+=ch;
+		j++;
+	}
+	Length=i;
+	LastNum=j;
+	encrypt();
+	memset(a,0,sizeof(a));
+	decrypt();
+	return 0;
+}
+
+long long nextPrime(long long x){
+	while(1){
+		int i;
+		for (i=2;i<=x/i;i++){
+			if (x%i==0){
+				break;
+			}
+		}
+		if (i>x/i){
+			return x;
+		}
+		else{
+			x++;
+		}
+	}
+}
+long long FORe2(long long  x){
+	long long y=(p-1)*(q-1);
+	if (y%x==0){
+		return -1;
+	}
+	long long i;
+	for (i=y+1;i>0;i+=y)
+		if (i%x==0){
+			break;
+		}
+	return i>0? i/x:-1;
+}
+long long fastAdd(long long x,long long y){
+	long long result;
+	if (y==0) return 0;
+	else {
+		while ((y&1)==0){
+			y>>=1;
+			x=x+x;
+			if (x>=n){
+				x=x-n;
+			}
+		}
+		result=x;
+		y>>=1;
+		while (y!=0){
+			x=x+x;
+			if (x>=n) {
+				x-=n;
+			}
+			if ((y&1)!=0){
+				result+=x;
+			}
+			if (result>=n){
+				result-=n;
+			}
+			y>>=1;
+		}
+	}
+	return result>=n? result%n:result;
+}
+long long fastExp(long long x,long long y){
+	long long result;
+	if (y==0) return 1;
+	else {
+		while ((y&1)==0){
+			y>>=1;
+			x=fastAdd(x,x);
+		}
+		result=x;
+		y>>=1;
+		while (y!=0){
+			x=fastAdd(x,x);
+			if ((y&1)!=0){
+				result=fastAdd(result,x);
+			}
+			y>>=1;
+		}
+	}
+	return result>=n? result%n:result;
+}
+void encrypt(){
+	for (int i=1;i<=Length;i++){
+		b[i]=fastExp(a[i],e1);		
+	}
+	for (int i=1;i<=Length;i++){
+		if (i==Length){
+			for (int j=1;j<=LastNum;j++){
+				printf("%c",(char)((b[i]>>((LastNum-j)*8))&127));
+			}
+		}
+		else {
+			printf("%c%c%c%c",(char)((b[i]>>24)&127),(char)((b[i]>>16)&127),(char)((b[i]>>8)&127),(char)(b[i]&127));
+		}
+	}
+	printf("\n");
+}
+void decrypt(){
+	for (int i=1;i<=Length;i++){
+		a[i]=fastExp(b[i],e2);		
+	}
+	for (int i=1;i<=Length;i++){
+		if (i==Length){
+			for (int j=1;j<=LastNum;j++){
+				printf("%c",(char)((a[i]>>((LastNum-j)*8))&127));
+			}
+		}
+		else {
+			printf("%c%c%c%c",(char)((a[i]>>24)&127),(char)((a[i]>>16)&127),(char)((a[i]>>8)&127),(char)(a[i]&127));
+		}
+	}
+	printf("\n");
+}

homework2017.2.26/C-level1/p08_hanoi.c

@@ -0,0 +1,19 @@
+#include<stdio.h>
+
+void hanoi(int n,char from,char mid,char aim);
+int main(){
+	int n;
+	scanf("%d",&n);
+	hanoi(n,'a','b','c');
+	return 0;
+}
+void hanoi(int n,char from,char mid,char aim){
+	if (n==1) {
+		printf("%c -> %c\n",from,aim);
+	}
+	else {
+		hanoi(n-1,from,aim,mid);
+		printf("%c -> %c\n",from,aim);
+		hanoi(n-1,mid,from,aim);
+	}
+}

homework2017.2.26/C-level1/p09_maze/mazeMap.txt

@@ -0,0 +1,7 @@
+#####*#
+#.###.#
+#.##..#
+#....##
+#.##.##
+#...###
+###@###