实验三

task 1

#include<stdio.h>
#include<stdlib.h>
#include<time.h>
#include<windows.h>
#define N 80

void printText(int Line, int col, char text[]);
void printSpaces(int n);
void printBlankLines(int n);

int main() /*在屏幕上随机位置打印 10 个“hi, May~”*/
{
int line, col, i;
char text[N]="hi, May~";

srand(time(0));

for(i=0;i<=10;i++)
{
line = rand()%25;
col = rand()%80;
printText(line, col, text);
Sleep(1000);
}

return 0;
}

void printSpaces(int n)
{
int i;

for(i=1; i<=n; i++)
{
printf(" ");
}
}

void printBlankLines(int n)
{
int i;

for(i=1; i<=n; i++)
{
printf("\n");
}
}

void printText(int line, int col, char text[])
{
printBlankLines(line-1);
printSpaces(col-1);
printf("%s",text);
}

目的：打印出10个hi may

task 2

#include<stdio.h>
long long fac(int n);

int main()
{
int i,n;

printf("Enter n:");
scanf("%d",&n);

for(i=1;i<=n;i++)
printf("%d!=%lld\n",i,fac(i));

return 0;
}

long long fac(int n)
{
static long long p=1;
p=p*n;

return p;
}

task2（2）

#include<stdio.h>
int func(int,int);

int main()
{
int k=4,m=1,p1,p2;

p1=func(k,m);
p2=func(k,m);
printf("%d,%d\n",p1,p2);

return 0;
}

int func(int a,int b)
{
static int m=0,i=2;

i+=m+1;
m=i+a+b;

return m;
}

task 3

#include<stdio.h>
long long fun(int n);

int main()
{
int n;
long long f;

while(scanf("%d",&n)!=EOF)
{
f=fun(n);
printf("n=%d, f=%lld\n",n,f);
}

return 0;
}

long long fun(int n)
{
long long f;
int i;

if(n==1)
f=1;
else
f=2*fun(n-1)+1;

return f;
}

task 4

#include<stdio.h>
void hanoi(unsigned int n,char from, char temp, char to);
void moveplate(unsigned int n,char from, char to);
int i;

int main()
{
unsigned int n;
while(scanf("%u",&n)!=EOF)
{
i=0;
hanoi(n,'A','B','C');
printf("\n一共移动了%d次\n\n",i);
}
return 0;
}

void hanoi(unsigned int n,char from, char temp, char to)
{
if(n==1)
moveplate(n,from,to);
else
{
hanoi(n-1,from,to,temp);
moveplate(n,from,to);
hanoi(n-1,temp,from,to);
}
}

void moveplate(unsigned int n,char from, char to)
{
printf("第%u个盘子：%c-->%c\n",n,from,to);
i++;
}

task 5

#include<stdio.h>
#define N 20

void is_prime(int n);

int main()
{
int j;
for(j=4;j<=N;j++)
{
if(j%2==0)
{
is_prime(j);
}
}
return 0;
}

void is_prime(int n)
{
int i,k,num1,num2;
for(num1=2;num1<n;num1++)
{
k=0;
for(i=2;i<num1;i++)
{
if(num1%i==0) k++;
}

if(k==0)
{
num2=n-num1;
}

k=0;
for(i=2;i<num2;i++)
{
if(num2%i==0) k++;
}

if(k==0&&num2>1&&num1<=num2)
{
printf("%d = %d + %d\n",n,num1,num2);
break;
}
}
}

task 6

#include<stdio.h>
long fun(long s);

int main()
{
long s,t;

printf("Enter a number：");
while(scanf("%ld",&s)!=EOF)
{
t=fun(s);
printf("new number is：%ld\n\n",t);
printf("Enter a number：");
}
return 0;
}

long fun(long s)
{
int i,j,k=0;
long l,t;
l=s;
for(i=0;l!=0;i++)
l/=10;
long start[i],end[i];
for(j=0;s!=0;j++)
{
start[j]=s%10;
if(start[j]%2!=0)
end[k++]=start[j];
s/=10;
}
end[k]='\0';
for(k=k-1;k>=0;k--)
{
t*=10;
t=end[k]+t;
}
return t;
}