To find multiplication of two numbers- Here, we are using a loop that will run second number times and adding the first number. For example:if we want to multiply 10 and 4 then either we can add 10, 4 times or we can add 4, 10 times. ...
C program to find the remainder of two numbers without using modulus (%) operator/* * Program to get remainder without using % operator. */ #include <stdio.h> int main() { int a,b,rem; printf("Enter first number :"); scanf("%d",&a); printf("Enter second number :"); scanf("...
const int gcdValue = gcdOfTwoNum(a, b); printf("\nThe GCD of the two numbers %d and %d is %d\n",a,b,gcdValue); return 0; } 2. Euclid’s Algorithm for Greatest Common Divisor: The following are the steps to find the GCD of two positive integers X and Y using Euclid’s algo...
C program to calculate the product of two numbers using recursion C program to find the HCF (Highest Common Factor) of given numbers using recursion C program to find the LCM (Lowest Common Multiple) of given numbers using recursion C program to find the GCD (Greatest Common Divisor) of giv...
C program to find sum of all numbers from 0 to N without using loop #include<stdio.h>intmain(void){intn,sum;//input value of nprintf("Enter the value of n:");scanf("%d",&n);//initialize sum with 0sum=0;//use formula to get the sum from 0 to nsum=n*(n+1)/2;//print...
// Java program to find the // Greatest Common Divisor import java.util.Scanner; public class Main { public static void main(String[] args) { int num1 = 0; int num2 = 0; int rem = 0; int X = 0; int Y = 0; Scanner SC = new Scanner(System.in); System.out.printf("Enter ...
Java program to add two complex numbers Java program to extract the last two digits from a given year Java program to read the height of the person, and the print person is taller, dwarf, or average height person Java program to find the sum of two numbers using binary addition ...
// Java program to find the // Lowest Common Multiple import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner SC = new Scanner(System.in); int num1 = 0; int num2 = 0; int rem = 0; int lcm = 0; int X = 0; int Y = 0; System.out...
1) Swapping two numbers using third variable To swap two values, there is a simple approach is using a temporary variable that stores the element for swapping. Algorithm Let, variableacontains first value, variablebcontains second value andtempis the temporary variable. ...
Rust | Find HCF using Recursion: Given two numbers, we have to calculate the HCF using recursion.Submitted by Nidhi, on October 11, 2021 Problem Solution:In this program, we will create a recursive function to calculate the HCF and return the result to the calling function....