}
inlineintadd-int(intx,inty,intz)
{
returnx+y+z;
}
#include
inlineintpower-int(intx)
{
return(x)*(x);
}
voidmain()
{
for(inti=1;i<=10;i++)
{
intp=power-int(i);
cout<
}
}
#include
intadd(int,int);
doubleadd(double,double);
voidmain()
{
cout<cout<}
intadd(intx,inty)
{
returnx+y;
}
doubleadd(doublea,doubleb)
{
returna+b;
}
15
15.5
#include
intmin(inta,intb);
intmin(inta,intb,intc);
intmin(inta,intb,intc,intd);
voidmain()
{
cout<cout<}
intmin(inta,intb)
{
returna
a:
b;
}
intmin(inta,intb,intc)
{
intt=min(a,b);
returnmin(t,c);
}
intmin(inta,intb,intc,intd)
{
intt1=min(a,b);
intt2=min(c,d);
returnmin(t1,t2);
}
Itisinmain.
It'sinfun2.
It'sinfun1.
It'sinfun3.
It'sbackinfun1.
It'sbackinfun2.
Itisbackinmain.
1k+2k+3k+\:
+nk
#include
constintk(4);
constintn(6);
intsum-of-powers(intk,intn),powers(intm,intn);
voidmain()
{
cout<<″sumof″<cout<}
intsum-of-powers(intk,intn)
{
intsum(0);
for(inti
(1);i<=n;i++)
sum+=powers(i,k);
returnsum;
}
intpowers(intm,intn)
{
inti,product
(1);
for(i=1;i<=n;i++)
product*=m;
returnproduct;
}
sumof4powersofintegersof1to6=2275
5*4*3*2*1*1等于120。
#include
longintfac(intn);
voidmain()
{
intn;
cout<<″Inputapositiveinteger:
″;
cin>>n;
longfa=fac(n);
cout<=″<}
longintfac(intn)
{
longintp;
if(n==0)p=1;
el