提示:文章写完后,目录可以自动生成,如何生成可参考右边的帮助文档
前言
提示:这里可以添加本文要记录的大概内容:
这是第五章4-12
提示:以下是本篇文章正文内容,下面案例可供参考
一、题目
二、代码
1.解
代码如下(示例):
4.#include<iostream>
using namespace std;
double zh(double n,double k)
{
double x=1,y=1,z=1,a=1,b=1,c=1,d,e;
while(a<=n)
{
x=x*a;
a=a+1;
}
while(b<=k)
{
y=b*k;
b=b+1;
}
d=n-k;
while(c<=d)
{
z=z*c;
c=c+1;
}
e=x/(y*z);
return e;
}
int main()
{
double n,k,c;
cin>>n>>k;
c=zh(n,k);
cout<<c<<endl;
return 0;
}
5.#include<iostream>
#include<cmath>
using namespace std;
double zh(double x,double u)
{
double e=0,t=1,i=1;
while((fabs(t))>=u)
{
e=e+t;
t=t*x/i;
i=i+1;
}
return e;
}
int main()
{
double n,u=1e-6,e;
cin>>n;
e=zh(n,u);
cout<<e<<endl;
return 0;
}
6.#include<iostream>
#include<cmath>
using namespace std;
int ss(int m)
{
double k;
int i;
k=sqrt(m);
for(i=2;i<=k;i++)
if (m%i==0) return 0;
return 1;
}
int main ()
{
int m,k,n=0;
for (m=3;m<=1000;m=m+2)
{
k=ss(m);
if(k==1)
{
cout<<m<<" ";
n=n+1;
if(n%5==0) cout<<endl;
}
}
return 0;
}
7.#include<iostream>
using namespace std;
int main(void)
{
int m,i=1,n=0,k,l;
for (m=1;m<=1000;m=m+1)
{
for (i=1;i<m;i=i+1)
{
if(m%i==0)
{
k=i;
n=n+k;
if(n==m)
{
cout<<m<<' '<<"its factors are:"<<' ';
for (l=1;l<=m;l=l+1)
{
if(m%l==0&&l!=m) cout<<l<<' ';
if(l==m) cout<<endl;
}
}
}
}
n=0;
}
return 0;
}
8.#include<iostream>
using namespace std;
int min(int a,int b)
{
int c;
c=(a<b)?a:b;
return c;
}
double min(double a,double b)
{
double c;
c=(a<b)?a:b;
return c;
}
int main()
{
int a,b,e;
double c,d,f;
cin>>a>>b;
e=min(a,b);
cout<<e<<endl;
cin>>c>>d;
f=min(c,d);
cout<<f<<endl;
return 0;
}
9-12
代码如下(示例):
9.#include<iostream>
using namespace std;
inline int max(int a,int b,int c)
{
int e;
e=(a>b)?a:b;
e=(e>c)?e:c;
return e;
}
int main()
{
int a,b,c,e;
cin>>a>>b>>c;
e=max(a,b,c);
cout<<e<<endl;
return 0;
}
10.#include<iostream>
using namespace std;
float jc(int n=10)
{
int sum=1;
for(;n>=1;n=n-1)
sum=sum*n;
return sum;
}
int main()
{
int n,x,y;
cin>>n;
x=jc();
y=jc(n);
cout<<x<<' '<<y<<endl;
return 0;
}
11.#include<iostream>
using namespace std;
int opp(int x,int n,int k)
{
if(n>1)
{
int b;
b=x%10;
x=x/10;
for(int i=1;i<n;i=i+1)
{
b=b*10;
}
k=k+b;
return opp(x,n-1,k);
}
else
{
k=k+x;
return k;
}
}
int main()
{
int x,n,k=0;
cout<<"请输入整数:"<<endl;
cin>>x;
cout<<"请输入该整数位数:"<<endl;
cin>>n;
k=opp(x,n,k);
cout<<k<<endl;
return 0;
}
12.#include<iostream>
using namespace std;
float fib(int n)
{
float f;
if(n==1||n==2) f=1;
else f=fib(n-1)+fib(n-2);
return f;
}
int main()
{
int n;
float f;
cin>>n;
f=fib(n);
cout<<f<<endl;
return 0;
}
---
# 11题的改良版
#include<iostream>
using namespace std;
int opp(int x,int k)
{
if(x!=0)
{
int b;
b=x%10;
k=k*10+b;
return opp(x/10,k);
}
else
{
k=k+x;
return k;
}
}
int main()
{
int x,k=0;
cout<<"请输入整数:"<<endl;
cin>>x;
k=opp(x,k);
cout<<k<<endl;
return 0;
}