3-7
#include <iostream>
using namespace std;
short int Exchange(unsigned int x,unsigned int y)
{
if (y==0)
return -1;
else
return x/y;
}
int main()
{
int number1,number2;
cin>>number1>>number2;
Exchange(number1,number2);
cout<<Exchange(number1,number2);
}
3-8
#include <iostream>
using namespace std;
int C(int temp)
{
int x,y;
x=temp-32;
y=x*5/9;
return y;
}
int main()
{
int F;
cin>>F;
C(F);
cout<<C(F);
}
3-10
#include <iostream>
using namespace std;
int Greatest_Common_Diverse(int x,int y)
{
int Diverse,remainder;
if(x>y)
{
do{
remainder=x%y;
x=y;
y=remainder;
}
while (remainder!=0);
Diverse=x;
return Diverse;
}
else
{
do{
remainder=y%x;
y=x;
x=remainder;
}
while (remainder!=0);
Diverse=y;
return Diverse;
}
}
int Least_Common_Multiple(int x,int y)
{
int multiple;
multiple=x*y/Greatest_Common_Diverse(x,y);
return multiple;
}
int main()
{
int number1,number2;
cin>>number1>>number2;
Greatest_Common_Diverse(number1,number2);
cout<<Greatest_Common_Diverse(number1,number2)<<endl;
Least_Common_Multiple(number1,number2);
cout<<Least_Common_Multiple(number1,number2)<<endl;
}
3-11
#include <iostream>
using namespace std;
int Sum(int x)
{
int sum;
if(x==1)
sum=1;
else
sum=x+Sum(x-1);
return sum;
}
int main()
{
int n;
cin>>n;
cout<<Sum(n);
}
3-13
#include <iostream>
using namespace std;
int Fibonacci(int x)
{
int fibonacci;
if (x==1)
fibonacci=1;
else if(x==2)
fibonacci=2;
else
fibonacci=Fibonacci(x-1)+Fibonacci(x-2);
return fibonacci;
}
int main()
{
int n;
cin>>n;
Fibonacci(n);
cout<<Fibonacci(n);
}
3-14
double P(int x,int n)
{
double p1;
if(n=0)
p1=1;
else if(n=1)
p1=x;
else
p1=(((2*n-1)*x*P(x,n-1))-(n-1)*P(x,n-2))/n;
return p1;
}
int main()
{
int i,j;
cin>>i>>j;
P(i,j);
cout<<P(i,j);
}