class Abc
{
public static void main(String[] args)
{
System.out.println("Hello World!");
}
}
write a c++ program to convert binary number to decimal number by using while statement
by this program you can find the factorial: #include<iostream> using namespace std; main() { int n,x,f=1; cin>> n; x=0; while(x<n) { x++; f= f*x; } cout<<"factorial is"<<f<<"\n"; system("pause"); return 0; }
A = 5do{statement;A = A + 1;} while (A < 10)
Function sum_odd_digits(ByVal number As Integer) As Integer Dim digit As Integer sum_odd_digits = 0 While number <> 0 digit = number Mod 10 If digit And 1 Then sum_odd_digits = sum_odd_digits + digit number = number / 10 End While End Function
A program can be looped in Python by wrapping the entire program in a for or while loop. If you wish to loop the program a finite amount of times, it can be done like so (x = the amount of times you want it to loop, this can be a number or variable storing a number): for i in range(0,x): [code] If you wish to loop the program infinitely, you can use a simple while loop: while True: [code]
write a c++ program to convert binary number to decimal number by using while statement
The following cases are all possible:- program without any for and while- program without for- program without while- program with both for and while
//program to find the factorial value f any number using while loop #include<stdio.h> void main() { int i,n,fact=1; printf("Enter the number\n"); scanf("%d",&n); i=n; while (i>=1) { fact=fact*i; i--; } printf("The factorial value=%d",fact); } the above is a program for calculating tha factorial value of any number which is entered by the user
/*Java program to find out square root of a given number * without using any Built-In Functions */ public class SquareRootDemo2 { public static void main(String[] args) { //Number for which square root is to be found double number = -12; //This method finds out the square root findSquareRoot(number); } /*This method finds out the square root without using any built-in functions and displays it */ public static void findSquareRoot(double number) { boolean isPositiveNumber = true; double g1; //if the number given is a 0 if(number==0) { System.out.println("Square root of "+number+" = "+0); } //If the number given is a -ve number else if(number<0) { number=-number; isPositiveNumber = false; } //Proceeding to find out square root of the number double squareRoot = number/2; do { g1=squareRoot; squareRoot = (g1 + (number/g1))/2; } while((g1-squareRoot)!=0); //Displays square root in the case of a positive number if(isPositiveNumber) { System.out.println("Square roots of "+number+" are "); System.out.println("+"+squareRoot); System.out.println("-"+squareRoot); } //Displays square root in the case of a -ve number else { System.out.println("Square roots of -"+number+" are "); System.out.println("+"+squareRoot+" i"); System.out.println("-"+squareRoot+" i"); } } }
That is any number that is an integer, and the square of another integer. For example, 4 is the square of 2, while 9 is the square of 3.That is any number that is an integer, and the square of another integer. For example, 4 is the square of 2, while 9 is the square of 3.That is any number that is an integer, and the square of another integer. For example, 4 is the square of 2, while 9 is the square of 3.That is any number that is an integer, and the square of another integer. For example, 4 is the square of 2, while 9 is the square of 3.
In the RAM
The program is here guys.......... //Finding whether the given number is perfect or not //Starts here #include<stdio.h> void main() { int i=1,temp=0,number; scanf("%d",&number); while(i<=number/2){ if(number%i==0) temp+=i; i++; } if(temp==number) printf("Its a perfect number"); else printf("Its not a perfect number"); } //ends here
Not used
eleporo
by this program you can find the factorial: #include<iostream> using namespace std; main() { int n,x,f=1; cin>> n; x=0; while(x<n) { x++; f= f*x; } cout<<"factorial is"<<f<<"\n"; system("pause"); return 0; }
A = 5do{statement;A = A + 1;} while (A < 10)
int i=0; while (i++<n) { /*...*/ }