作業(yè)系統(tǒng)第四次第三次

#include<iostream>usingnamespacestd;

/**********Program**********/charcapitalize(charcp){

if(cp>='a'&&cp<='z')cp=cp-32;

returncp;

}

/********** End **********/

intmain(){

inti=0;charcp[30];

cout<<"請輸入包含小寫字母的句子："<<endl;cin.getline(cp,30);

while(cp[i]!='\0')cout<<capitalize(cp[i++]); //函數調用cout<<endl;

return0;

}

#include<iostream>usingnamespacestd;

/**********Program**********/int monDevisor(inti,intj)

{

intc,d;if(i<j)

{c=i;i=j;j=c;

}

while(j!=0)

{

d=i%j;i=j;j=d;

}

returni;

}

int monMultiple(inti,intj)

{

inte;

e=i* monDevisor(i,j);returne;

}

/********** End **********/intmain(){

inti,j;

cout<<"請輸入兩個整數："<<endl;cin>>i>>j;

cout<<"最大公約數："<< monDevisor(i,j) //調用最大公約數函數

<<'\t'<<"最小公倍數："<< monMultiple(i,j)<<endl; //調用最小公倍數函數return0;

}

#include<iostream>usingnamespacestd;

/**********Program**********/intdigit(intnum,intk)

{

intm,i;

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

{

m=num%10;num=(num-m)/10;

}

if(num==m)m=0;returnm;

}

/********** End **********/

intmain(){

intnum,k;

cin>>num>>k;

cout<<"digit("<<num<<","<<k<<")="<<digit(num,k)<<endl;return0;

}

#include<iostream>usingnamespacestd;

/**********Program**********/intfactors(intnum,intk){

inti=0;

while(num%k==0){num=num/k;

i=i+1;

}

returni;

}

/********** End **********/

intmain(){

intnum,k;

cin>>num>>k;

cout<<"factors("<<num<<","<<k<<")="<<factors(num,k)<<endl;return0;

}

#include<iostream>#include<cmath>

usingnamespacestd;

/**********Program**********/intprime(intn){

inti;

if(n==2)returnn;else{

for(i=2;i<n;i++)if(n%i==0)return0;if(i>=n)returnn;

}

}

/********** End **********/

intmain(){

for(intn=4;n<=50;n+=2){

for(inti=2;i<=n/2;i++)

if(prime(i)&&prime(n-i))

cout<<n<<'='<<i<<'+'<<n-i<<endl;//列出所有可能組合

}

return0;

}

#include<iostream>usingnamespacestd;

/**********Program**********/intAcm(intm,intn)

{

inty;

if(m==0)y=n+1;

if(n==0)y=Acm(m-1,1);

if(n>0&&m>0)y=Acm(m-1,Acm(m,n-1));returny;

}

/**********End**********/

intmain(){

cout<<"Acm(2,1)="<<Acm(2,1)<<endl;cout<<"Acm(3,2)="<<Acm(3,2)<<endl;return0;

}

#include<iostream>usingnamespacestd;

/**********Program**********/doubleP(doublen,doublex)

{

doubley;

if(n==0)y=1;if(n==1)y=x;

if(n>1)y=((2*n-1)*x*P(n-1,x)-(n