Skip to content
Open

work #28

Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
27 changes: 27 additions & 0 deletions level1/p01_runningLetter/Running letter.c
Original file line number Diff line number Diff line change
@@ -0,0 +1,27 @@
#include<stdio.h>
#include<stdlib.h>
#define LENGTH 110
int main(void)
{
int i;
int j=0;
for(i=0;i<LENGTH;i++)
{
for(j=0;j<i;j++)
{
printf(" ");
}
printf("letter");
system("CLS");
}
for(i=LENGTH;i>0;i--)
{
for(j=i;j>0;j--)
{
printf(" ");
}
printf("letter");
system("CLS");
}
return 0;
}
20 changes: 20 additions & 0 deletions level1/p02_isPrime/isPrime.c
Original file line number Diff line number Diff line change
@@ -0,0 +1,20 @@
#include<stdio.h>
int main(void)
{
int number;
int i=2;
scanf("%d",&number);
for(i=2;i<number;i++)
{
if(number%i==0)
{
printf("NotPrime");
break;
}
}
if(i==number)
{
printf("istPrime");
}
return 0;
}
9 changes: 9 additions & 0 deletions level1/p03_Diophantus/Diophantus.c
Original file line number Diff line number Diff line change
@@ -0,0 +1,9 @@
#include<stdio.h>
int main(void)
{
double age=20;
for(age=20;age!=age/6+age/12+age/7+5+age/2+4;age++)
printf("%f\n",age);
printf("The age is %.0f",age);
return 0;
}
16 changes: 16 additions & 0 deletions level1/p04_ narcissus/narcissus.c
Original file line number Diff line number Diff line change
@@ -0,0 +1,16 @@
#include<Stdio.h>
#define MAX 1000
int main(void)
{
int number;
for(number=100;number<1000;number++)
{
int i=number%10;
int j=(number/10)%10;
int k=number/100;
if(number==i*i*i+j*j*j+k*k*k)
printf("%d\n",number);
}
return 0;

}
39 changes: 39 additions & 0 deletions level1/p06_Goldbach/GoldBash.c
Original file line number Diff line number Diff line change
@@ -0,0 +1,39 @@
#include<stdio.h>
#include<math.h>
char judge(int a);
int Prime(int b);
int m,n;
int main(void)
{
int number,i;
for(i=2;i<101;i+=2)
{
judge(i);
printf("%d+%d=%d\n",m,n,i);
}
return 0;
}
char judge(int a)
{
for(m=1;m<a/2+1;m++)
{
n=a-m;
if(Prime(m)&&Prime(n))
return;
}
return;
}
int Prime(int b)
{
int i;
for(i=2;i<sqrt(b);i++)
if(b%i==0)
{
return 0;
}
else if((i+1)*(i+1)>b)
{
return 1;
}

}
45 changes: 45 additions & 0 deletions level1/p07_encrypt_decrypt/Encrypt_decrypt.c
Original file line number Diff line number Diff line change
@@ -0,0 +1,45 @@
#include<stdio.h>
#include<stdlib.h>
void Encrypt(char a[]);
void Decrypt(char b[]);
char str_ing[50];
int judge;
int main(void)
{
printf("Input\n");
scanf("%s",str_ing);
printf("����������1\n����������2\n�˳�������������\n");
scanf("%d",&judge);
switch(judge)
{
case 1:
Encrypt(str_ing);
break;
case 2:
Decrypt(str_ing);
break;
default:
exit(0);
}
return 0;
}
void Encrypt(char a[])
{
int j=0;
for(j=0;str_ing[j]!='\0';j++)
{
str_ing[j]-=1;
}
printf("����Ϊ %s",str_ing);
return;
}
void Decrypt(char b[])
{
int j=0;
for(j=0;str_ing[j]!='\0';j++)
{
str_ing[j]+=1;
}
printf("��������Ϊ %s",str_ing);
return;
}
24 changes: 24 additions & 0 deletions level1/p08_hanoi/Hanoi.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,24 @@
#Hanoi
#include<stdio.h>
void Hanoi(int n,char A,char B,char C)
{
if(n==1){
printf("将第%d个圆盘从%c移动到%c\n",n,A,C);
}
else{
Hanoi(n-1,A,C,B);
printf("将第%d个圆盘从%c移动到%c\n",n,A,C);
Hanoi(n-1,B,A,C);
}
}
int main()
{
int i;
scanf("%d",&i);
char X='x';
char Y='y';
char Z='z';
Hanoi(i,X,Y,Z);
return 0;
}

22 changes: 22 additions & 0 deletions level1/p08_hanoi/Tower of Hanoi.c
Original file line number Diff line number Diff line change
@@ -0,0 +1,22 @@
#include<stdio.h>
void Hanoi(int n,char A,char B,char C)
{
if(n==1){
printf("����%d��Բ�̴�%c�ƶ���%c\n",n,A,C);
}
else{
Hanoi(n-1,A,C,B);
printf("����%d��Բ�̴�%c�ƶ���%c\n",n,A,C);
Hanoi(n-1,B,A,C);
}
}
int main()
{
int i;
scanf("%d",&i);
char X='x';
char Y='y';
char Z='z';
Hanoi(i,X,Y,Z);
return 0;
}
90 changes: 90 additions & 0 deletions level1/p09_maze/maze.c
Original file line number Diff line number Diff line change
@@ -0,0 +1,90 @@
#include<stdio.h>
#include<stdlib.h>
int manhang=9;int manlie=8;
int map[11][11];
void get(void); /*��ʦΪɶ�ҵij�����Ҫ�����²����ƶ�һ����*/
void print(int a[11][11]); /*�� �� ��*/
int main(void)
{
int hang=1,lie=1;
for(hang=1;hang<=10;hang++)
{
for(lie=1;lie<=10;lie++)
{
map[hang][lie]=1;
}
}
map[4][1]=map[4][2]=map[5][2]=map[6][2]=map[6][3]=map[6][4]=0;
map[5][4]=map[4][4]=map[3][4]=map[2][4]=map[2][5]=map[2][6]=0;
map[2][7]=map[2][8]=map[2][9]=map[3][9]=map[4][9]=map[5][9]=0;
map[6][9]=map[7][9]=map[7][8]=map[8][8]=map[9][8]=0;
map[3][6]=map[4][6]=map[5][6]=map[6][6]=map[7][6]=0;
map[9][8]=2;
print(map[11][11]);
int judge=1;

while(judge)
{
fflush(stdout);
get();
system("CLS");
map[manhang][manlie]=2;
map[9][8]=0;
print(map[11][11]);
if(manhang==10||manhang==1||manlie==1||manlie==10)
{
judge=0;
}
}
printf("Success\n");
getchar();
return 0;
}

void get(void)
{
if(getch()=='w'&&map[manhang-1][manlie]==0)
{
map[manhang][manlie]=0;
manhang-=1;
}
if(getch()=='s'&&map[manhang+1][manlie]==0)
{
map[manhang][manlie]=0;
manhang+=1;
}
if(getch()=='a'&&map[manhang][manlie-1]==0)
{
map[manhang][manlie]=0;
manlie-=1;
}
if(getch()=='d'&&map[manhang][manlie+1]==0)
{
map[manhang][manlie]=0;
manlie+=1;
}
return;
}

void print(int a[11][11])
{
int i,j=1;
for(i=1;i<11;i++)
{
for(j=1;j<11;j++)
{
if(map[i][j]==1)
{
printf("#");
}
else if(map[i][j]==0)
{
printf(" ");
}
else printf("$");
}
printf("\n");
}
printf("\n Get from keyborad \nYou should aim the board for four times\n ");
return;
}
Loading