.
#include
{void godbaha(int); int n;
cout<<\ cin>>n; godbaha(n); return 0; }
void godbaha(int n) {int prime(int); int a,b;
for(a=3;a<=n/2;a=a+2) {if(prime(a)) {b=n-a;
if (prime(b)) cout< int prime(int m) {int i,k=sqrt(m); for(i=2;i<=k;i++) if(m%i==0) break; if (i>k) return 1; else return 0; } 4.8题//递归法 #include float p(int,int); cout<<\ cin>>n>>x; cout<<\ cout<<\ return 0; } float p(int n,int x) . . {if (n==0) return(1); else if (n==1) return(x); else return(((2*n-1)*x-p((n-1),x)-(n-1)*p((n-2),x))/n); } 4.9题//汉诺塔问题 #include {void hanoi(int n,char one,char two,char three); int m; cout<<\ cin>>m; cout<<\ hanoi(m,'A','B','C'); return 0; } void hanoi(int n,char one,char two,char three) //将n个盘从one座借助two座,移到three座 {void move(char x,char y); if(n==1) move(one,three); else {hanoi(n-1,one,three,two); move(one,three); hanoi(n-1,two,one,three); } } void move(char x,char y) {cout< #include {void convert(int n); int number; cout<<\ cin>>number; cout<<\ if (number<0) . . {cout<<\ number=-number; } convert(number); cout< void convert(int n) //感觉根本想不出的么 {int i; char c; if ((i=n/10)!=0) convert(i); c=n+'0'; cout<<\ } 4.11题 #include cout<<\ cin>>n; s=f(n); cout<<\ return 0; } int f(int n) {; if (n==1) return 1; else return (n*n+f(n-1)); } 4.12题 #include . . #define S(a,b,c) (a+b+c)/2 #define AREA(a,b,c) sqrt(S(a,b,c)*(S(a,b,c)-a)*(S(a,b,c)-b)*(S(a,b,c)-c)) int main() {float a,b,c; cout<<\ cin>>a>>b>>c; if (a+b>c && a+c>b && b+c>a) cout<<\ else cout<<\ return 0; } 4.14题 #include //#define LETTER 1 int main() {char c; cin>>c; #if LETTER if(c>='a' && c<='z') c=c-32; #else if(c>='A' && c<='Z') c=c+32; #endif cout< 4.15题 #include cout<<\ gets(ch); #if (CHANGE) {for (int i=0;i<40;i++) {if (ch[i]!='\\0') if (ch[i]>='a'&& ch[i]<'z'||ch[i]>'A'&& ch[i]<'Z') ch[i]+=1; . . else if (ch[i]=='z'||ch[i]=='Z') ch[i]-=25; } } #endif cout<<\ return 0; } 4.16题file #include {extern int power(int); int b=3,c,d,m; cout<<\ cin>>a>>m; c=a*b;
相关推荐: