# Function to find HCF the Using Euclidian algorithmdefcompute_hcf(x, y):while(y): x, y = y, x % yreturnx hcf = compute_hcf(300,400)print("The HCF is", hcf) Run Code Here we loop untilybecomes zero. The statementx, y = y, x % ydoes swapping of values in Python. Click ...
The HCF or GCD of two integers is the largest integer that can exactly divide both numbers (without a remainder). There are many ways to find the greatest common divisor in C programming. Example #1: GCD Using for loop and if Statement #include <stdio.h> int main() { int n1, n2, ...
Rust | Find HCF using Recursion: Given two numbers, we have to calculate the HCF using recursion. Submitted byNidhi, 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. Program/Source ...
C - Calculate X^N (X topower of N) using pow function C - Find difference of two numbers C - Print size of variables using sizeof() operator C - Demonstrate examples of escape sequences C - Find area & perimeter of circle C - Find area of a rectangle C - Calculate HCF of two ...
CoreProgram built to share the Programming knowledge in the community. Focused .NET, Angular, Hybrid Mobile application, Python etc.
Area of rectangle program in c /*C program to find area of a rectangle.*/#include<stdio.h>intmain(){floatl,b,area;printf("Enter the value of length:");scanf("%f",&l);printf("Enter the value of breadth:");scanf("%f",&b);area=l*b;printf("Area of rectangle:%f\n",area);ret...
Rust | Factorial using Recursion: Write a program to find the factorial of a given number using recursion.Submitted by Nidhi, on October 10, 2021 Problem Solution:In this program, we will create a recursive function to calculate the factorial of the given number and print the result....
Output: sum = 55 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*...
// Java program to convert hexadecimal Byte// to an integerpublicclassMain{staticintgetNum(charch){intnum=0;if(ch>='0'&&ch<='9'){num=ch-0x30;}else{switch(ch){case'A':case'a':num=10;break;case'B':case'b':num=11;break;case'C':case'c':num=12;break;case'D':case'd':num...
// Java program to find the// Greatest Common Divisorimportjava.util.Scanner;publicclassMain{publicstaticvoidmain(String[]args){intnum1=0;intnum2=0;intrem=0;intX=0;intY=0;Scanner SC=newScanner(System.in);System.out.printf("Enter Number1: ");num1=SC.nextInt();System.out.printf("Ente...