A.1

#include

#include

float fun(float x,int n){

if(0==n){

return 1;

}else if(1==n){

return x;

}else{

return ((2*n-1)*x-fun(x,n-1)-(n-1)*fun(x,n-2)/n);

}

}

void main(){

int n;

float p,x;

cout<

cout<

cout<

}//main

A.2

#include

#include

#include

int fun1(int n){

int temp;

temp=(int)sqrt(n);

if(n==temp*temp){

return 1;

}else{

return 0;

}

}

int fun2(int n){

int a[3],i;

for(i=0;i<3;i++){

a=n%10;

n/=10;

}

if(a[0]== a[1] || a[1]== a[2] || a[0]== a[2])return (1);

else return 0;

}

void main(){

int n;

for(n=100;n<1000;n++){

if(fun1(n) && fun2(n)){

cout<

}

}

}//main

A.3

#include

struct{

int year;

int month;

int day;

}date;

void main()

{

int days;

cout<

cin>>date.year>>date.month>>date.day;

switch(date.month)

{

case 1: days=date.day; break;

case 2: days=date.day+31; break;

case 3: days=date.day+31+28;break;

case 4: days=date.day+31+28+31;break;

case 5: days=date.day+31+28+30+31;break;

case 6: days=date.day+31+28+31+30+30;break;

case 7: days=date.day+31+28+31+30+30+31;break;

case 8: days=date.day+31+28+31+30+30+31+31;break;

case 9: days=date.day+31+28+31+30+30+31+31+30;break;

case 10: days=date.day+31+28+31+30+30+31+31+30+31;break;

case 11: days=date.day+31+28+31+30+30+31+31+30+31+30;break;

case 12: days=date.day+31+28+31+30+30+31+31+30+31+30+31;break;

}//switch(month)

if(((date.year%4==0&&date.year%100!=0)||date.year%400==0)&&date.month>=3)

days+=1;

cout<

}//main

A.3’

#include

#include

#include

int leapyear(int year){

if(year%4==0&&year%100!=0|| year%400==0){

return 1;

}else return 0;

}

void main(){

int year,month;

int num=0,feb=0;

cout<

cin>>year>>month;

if(leapyear(year)) feb=29;

else feb=28;

switch(month){

case 1: num=num+31; break;

case 2: num=num+31+feb; break;

case 3: num=num+31+feb+31;break;

case 4: num=num+31+feb+31+30;break;

case 5: num=num+31+feb+31+30+31;break;

case 6: num=num+31+feb+31+30+31+30;break;

case 7: num=num+31+feb+31+30+31+30+31;break;

case 8: num=num+31+feb+31+30+31+30+31+31;break;

case 9: num=num+31+feb+31+30+31+30+31+31+30;break;

case 10: num=num+31+feb+31+30+31+30+31+31+30+31;break;

case 11: num=num+31+feb+31+30+31+30+31+31+30+31+30;break;

case 12: num=num+31+feb+31+30+31+30+31+31+30+31+30+31;break;

}//switch(month)

cout<

}//main

A.4

//迭代公式：x2=(x1+n/x1)/2，当x2-x1绝对值小于0.00001停止迭代

#include

#include

#include

float fun(float n)

{float x1=1,x2=1;

do{x1=x2;

x2=(x1+n/x1)/2.0f;}

while(fabs(x2-x1)>0.00001);

return x2;}

void main()

{cout<

cout<

A.5

#include

#include

#include

int fun(int n)

{int i,sum=0;

for(i=1;i

{if(n%i==0) sum+=i;}

return sum;}

void main()

{int m,n,a,b;

cout<

10

cin>>m>>n;

for(a=m;a<=n;a++){b=fun(a);

if(a==fun(b) && a

cout<

A.6

#include

#include

#include

void main()

{int a[10]={12,34,3,89,76,24,10,67,33,17};

int i,max=0,sum2=0,index=0;

max=a[0]+a[1]+a[2];

for(i=1;i<10;i++)

{sum2=a+a[(i+1)%10]+a[(i+2)%10];

if(sum2>max)

{index=i;

max=sum2;}}

cout<

A.7

#include

#include

#include

struct Node{

int data;

Node * per;

Node * next;

};

void main()

{

int a[1000],num=-1,i,j,temp;

Node * head , * cur,*fir;

cout<

do{

num++;

cin>>a[num];

}while(-1!=a[num]);

for(i=0;i

for(j=i+1;j

if(a>a[j]){temp=a; a=a[j]; a[j]=temp;}

head=cur= fir=new Node;

cur->per =NULL;

cur->next =NULL;

cur->data=a[0];

for(i=1;i

{

cur=new Node;

cur->data=a;

fir->next=cur;

cur->per=fir;

cur->next=NULL;

fir=cur;

}

head->per=fir;

fir->next=head;

for(; fir!=head; )

{

cout<data<

fir=fir->per;

}

cout<data<

}//main

B.1

#include

#include

void main()

{ int m,n,i,imax=0,sum=0;

cout<

cin>>m>>n;

for(i=1;i<=n;i++)

{ imax=imax*10+m;

sum+=imax;

}

cout<

}

B.1’

#include

#include

using namespace std;

void main()

{double a,n;

double temp=0;

int sum=0;

int x;

cin>>a>>n;

for(double i=0;i

temp+=a*pow(10,i);

cout<

x=temp/10;

sum=temp;

for(int j=1;j<=n;j++)

{sum=sum+x;

x=x/10;}

cout<

B.2

#include

void main()

{ int i=1;

double e=1.0,d=1.0;

while(d>=0.000001)

{ i++;

d=d/i;

e+=d;

}

cout<

"<

}

B.3

#include

using namespace std;

void main(){

int i=0;

while(!((i%2==1)&&(i%3==2)&&(i%4==3)&&(i%5==4)))

i++;

cout<

B.4

#include

void tran(int num)

{

int a[100];

int i=0;

for(i=0;i<100;i++)

{

a=num%16;

num/=16;

if(num==0) break;

}

for(;i>=0;i--)

{

switch(a)

{

case 10:

cout<

break;

case 11:

cout<

break;

case 12:

cout<

break;

case 13:

cout<

break;

case 14:

cout<

break;

case 15:

cout<

break;

default:

cout<

break;

}

}

}

void main()

{

int num;

cin>>num;

tran(num);

}

B.4’

#include

void main()

{ int a[100],num,i=0;

cin>>num;

while(num!=0)

{ a=num%16;

num=num/16;

i++;

}

i--;

for(;i>=0;i--)

{

switch(a)

{

case 10:

{

cout<

}

case 11:

{

cout<

}

case 12:

{

cout<

}

case 13:

{

cout<

}

case 14:

{

cout<

}

case 15:

{

cout<

}

default:

{

cout<