In this tutorial, we will be discussing a program to find the maximum of smallest possible area that can get with exactly k cut of given rectangular.For this we will be provided with the sides of the rectangle and the number of cuts that can be made. Our task is to calculate the smallest area that can be achieved by making the given number of cuts.Example Live Demo#include using namespace std; void max_area(int n, int m, int k) {    if (k > (n + m - 2))       cout

In this tutorial, we will be discussing a program to find HCF (highest common factor) of two numbers.For this we will be provided with two numbers. Our task is to find the highest common factor (HCF) of those numbers and return it.Example Live Demo#include //recursive call to find HCF int gcd(int a, int b){    if (a == 0 || b == 0)       return 0;    if (a == b)       return a;    if (a > b)       return gcd(a-b, b);    return gcd(a, b-a); } int main(){    int a = ... Read More

In this tutorial, we will be discussing a program to find greater value between a^n and b^n.For this we will be provided with three numbers. Our task is to calculate a^n and b^n and return back the greater of those values.Example Live Demo#include using namespace std; //finding the greater value void findGreater(int a, int b, int n){    if (!(n & 1)) {       a = abs(a);       b = abs(b);    }    if (a == b)       cout b)       cout

In this tutorial, we will be discussing a program to find GCD and HCF of two numbers.For this we will be provided with two numbers. Our task is to find the GCD or HCF (highest common factor) for those given two numbers.Example Live Demo#include using namespace std; int gcd(int a, int b){    if (a == 0)       return b;    if (b == 0)       return a;    if (a == b)       return a;    if (a > b)       return gcd(a-b, b);    return gcd(a, b-a); } int main(){    int a = 98, b = 56;    cout

In this tutorial, we will be discussing a program to find GCD or HCF of two numbers using Middle School Procedure.For this we will be provided with two numbers. Our task is to find the GCD (greatest common divisor) or HCF (highest common factor) for the given values.Example Live Demo#include #define MAXFACTORS 1024 using namespace std; //structure to store factorization typedef struct{    int size;    int factor[MAXFACTORS + 1];    int exponent[MAXFACTORS + 1]; } FACTORIZATION; void FindFactorization(int x, FACTORIZATION* factorization){    int i, j = 1;    int n = x, c = 0;    int k = ... Read More

In this tutorial, we will be discussing a program to find GCD of floating point numbers.For this we will be provided with two integers. Our task is to find the GCD (Greatest common divisor) of those two provided integers.Example Live Demo#include using namespace std; //returning GCD of given numbers double gcd(double a, double b){    if (a < b)       return gcd(b, a);    if (fabs(b) < 0.001)       return a;    else       return (gcd(b, a - floor(a / b) * b)); } int main(){    double a = 1.20, b = 22.5;    cout

In this tutorial, we will be discussing a program to find N lccanobif numbers.For this we will be provided with an integer. Our task is to find the lccanobif number at that position. They are similar to the fibonacci number except the fact that we add the previous two numbers after reversing their digits.Example Live Demo#include using namespace std; //reversing the digits of a number int reverse_digits(int num){    int rev_num = 0;    while (num > 0) {       rev_num = rev_num * 10 + num % 10;       num = num / 10;   ... Read More

In this tutorial, we will be discussing a program to find equation of a plane passing through 3 points.For this we will be provided with 3 points. Our task is to find the equation of the plane consisting of or passing through those three given points.Example Live Demo#include #include #include #include using namespace std; //finding the equation of plane void equation_plane(float x1, float y1, float z1, float x2, float y2, float z2, float x3, float y3, float z3){    float a1 = x2 - x1;    float b1 = y2 - y1;    float c1 = z2 - ... Read More

In this tutorial, we will be discussing a program to find Cullen Number.For this we will be provided with an integer. Our task is to find the cullen number at that position using the formula −2n* n + 1Example Live Demo#include using namespace std; //finding the nth cullen number unsigned get_cullen(unsigned n){    return (1

In this tutorial, we will be discussing a program to find covariance.For this we will be provided with two sets of random variables. Our task is to calculate their covariance i.e, the measure of how much those two values differ together.Example Live Demo#include using namespace std; //function to find mean float mean(float arr[], int n){    float sum = 0;    for(int i = 0; i < n; i++)    sum = sum + arr[i];    return sum / n; } //finding covariance float covariance(float arr1[], float arr2[], int n){    float sum = 0;    for(int i = 0; i ... Read More