Skip to content
Open
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
33 changes: 33 additions & 0 deletions level1/p01_runningLetter/zuoye/跳动的字符.c
Original file line number Diff line number Diff line change
@@ -0,0 +1,33 @@
#include <stdio.h>
#include <stdlib.h>
#include <windows.h>
int main()
{
int i=0,j=1,m=0,k;
char words[20];
scanf("%s",words);
k=strlen(words); // ȡ�ַ�������
system("mode con cols=100");//�趨����̨����
while(1)
{
printf("%s",words);
system("cls"); //����
for(i=0;i<j;i++)
{
printf(" ");
}
if(j==100-k)
m=1;
if(j==0)
m=0;
if(m==0)
j++;
else if(m==1)
j--;
Sleep(100);
}

return 0;
}


31 changes: 31 additions & 0 deletions level1/p02_isPrime/素数的判断.c
Original file line number Diff line number Diff line change
@@ -0,0 +1,31 @@
#include <stdio.h>
#include <stdlib.h>
#include <math.h>

int main()
{
int prime;
int i;
int j;
printf("请输入一个正整数");
scanf("%d",&prime);
if(prime==1)
{
printf("%d不是素数\n",prime);
}
else
{
for(i=2;i<=prime-1;i++)
{
if( prime%i==0)
{
printf("%d不是素数\n",prime);
return 0;
}
}
printf("%d是素数\n",prime);
}
system("pause");
return 0;
}

21 changes: 21 additions & 0 deletions level1/p03_Diophantus/丢番图年龄.cpp
Original file line number Diff line number Diff line change
@@ -0,0 +1,21 @@
#include <stdio.h>
#include <stdlib.h>

int main()
{
double diufantu_age;
double d_son_age;
for(diufantu_age=12.0; ;diufantu_age++)
{
d_son_age=diufantu_age/2;
double sum=diufantu_age/6+diufantu_age/12+diufantu_age/7+5.0+4.0+d_son_age;
if(diufantu_age==sum)
{
break;
}


}
printf("diufantu's age is %-6.f",diufantu_age);
return 0;
}
22 changes: 22 additions & 0 deletions level1/p04_ narcissus/水仙花数.cpp
Original file line number Diff line number Diff line change
@@ -0,0 +1,22 @@
#include <stdio.h>
#include <stdlib.h>

int main()
{
int n;
int a=0,b=0,c=0;
int sum;
for(n=100;n<1000;n++)
{
a=n/100;
b=n/10-n/100*10;
c=n/1-n/100*100-b*10;
sum=a*a*a+b*b*b+c*c*c;
if(sum==n)
{
printf("%d ",n);
}
}
return 0;
}

41 changes: 41 additions & 0 deletions level1/p05_allPrimes/打印all素数.cpp
Original file line number Diff line number Diff line change
@@ -0,0 +1,41 @@
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <time.h>

bool judge(int prime)
{
int i;
int j;
for(i=2;i<=(int)sqrt(prime);i++)
{
j=prime%i;
if(j==0)
{
return false;
}
}
return true;
}

int main()
{
int prime,clock1,clock2;
clock1=clock();
for(prime=2;prime<1001;prime++)
{
if(prime==2)
{
printf(" %d ",prime);
}

else if(judge(prime))
{
printf(" %d ",prime);
}
}
clock2=clock();
printf("ʱ����%d����",clock2-clock1);
return 0;
}

66 changes: 66 additions & 0 deletions level1/p06_Goldbach/哥德巴赫猜想的正确性.cpp
Original file line number Diff line number Diff line change
@@ -0,0 +1,66 @@
#include <stdio.h>
#include <stdlib.h>
bool judge(int prime)
{
int i;
for(i=2;i<prime-1;i++)
{
if(prime%i==0)
return false;
}
return true;
}


int main()
{
int prime[50],even[50];
int n=0;
int m=0;
int q=0;
int j=0;
for(int i=4;i<100;i++)
{
even[j]=i;
i++;
j++;

}
for(int i=2;i<100;i++)
{
if(i==2)
{
prime[n]=i;
n++;
}
else if(judge(i))
{
prime[n]=i;
n++;
}

}
for(m=0;m<50;m++)
{
for(n=0;n<50;n++)
{
for(q=0;q<50;q++)
{
if(even[m]==prime[n]+prime[q])
{
printf("it is true\n");
return 0;
}
}

}
}
printf("it is false\n");
return 0;
}






84 changes: 84 additions & 0 deletions level1/p07_encrypt_decrypt/解密加密函数.cpp
Original file line number Diff line number Diff line change
@@ -0,0 +1,84 @@
#include <stdio.h>
#include <stdlib.h>
#include <string.h>

void jiami(char a[200])
{
for(int i=0;i<200;i++)
{
if(a[i]<='W'&&a[i]>='A')
{
a[i]=a[i]+3;
}
else if(a[i]>='X'&&a[i]<='Z')
{
a[i]=a[i]-23;
}
if(a[i]<='w'&&a[i]>='a')
{
a[i]=a[i]+3;
}
else if(a[i]>='x'&&a[i]<='z')
{
a[i]=a[i]-23;
}
}
printf("���ܺ���");
puts(a);
}

void jiemi(char b[200])
{
for(int i=0;i<200;i++)
{
if(b[i]<='Z'&&b[i]>='D')
{
b[i]=b[i]-3;
}
else if(b[i]<='C'&&b[i]>='A')
{
b[i]=b[i]+23;
}
if(b[i]<='z'&&b[i]>='d')
{
b[i]=b[i]-3;
}
else if(b[i]<='c'&&b[i]>='a')
{
b[i]=b[i]+23;
}
}
printf("���ܺ���");
puts(b);
}

int main()
{
char mima[200];
gets(mima);
jiami(mima);
jiemi(mima);
return 0;
}






















28 changes: 28 additions & 0 deletions level1/p08_hanoi/汉诺塔问题的递归.cpp
Original file line number Diff line number Diff line change
@@ -0,0 +1,28 @@
#include <stdio.h>
#include <stdlib.h>

void function(int panzishu,char a,char b,char c)
{
if(panzishu==1)
{
printf("将%c===>%c\n",a,c);
}
else
{
function(panzishu-1,a,c,b);
printf("将%c===>%c\n",a,c);
function(panzishu-1,b,a,c);
}
}
int main()
{
int panzishu;
char a,b,c;
a='a';
b='b';
c='c';
printf("请输入汉诺塔的盘子数量:");
scanf("%d",&panzishu);
function(panzishu,a,b,c);
return 0;
}
Loading