Skip to main content

How to find Power of a number in C

 How to find Power of a number in C: -

In this program we will calculate the power of a number using C programming. We want to calculate the power of any given number so you need to multiply that particular number power of time.

Ex:-

  1. Let suppose number is 24 so we need to multiply with 4 times of 2. That is 2*2*2*2=16.


ALGORITHMS:-

Step 1– Enter the base number, the number in which you just want to find the power of the number.
Step 2– Enter the exponential, the power of the number.
Step 3– Initialize while loop, while the exponential is not equal to zero.
                (i) do temp*number and store it in the temp.
                 (ii) now reduce the exponential with -1.
                  Here you got the power of the number.
Step 4– Now print the temp variable.
Step 5- Stop.

CODE: -

#include<stdio.h>
int main()
{
    int base,exp=1,temp=1;
    printf("Enter the base value: ");
    scanf("%d",&base);
    printf("Enter the exp value: ");
    scanf("%d",&exp);
    while(exp!=0)
    {
        temp=temp*base;
        exp--;
    }
    printf("the value of power is %d",temp);
    return 0;
    
}


OUTPUT:-

FOLLOW THIS WEBPAGE FOR MORE NEW PROGRAMS AND CODING SOLUTIONS.





Comments

Popular posts from this blog

Top 10 Secure Computing Tips

Top 10 Secure Computing Tips:-   "Top 10" List of Secure Computing Tips Tip #1 - You are a target to hackers Don't ever say, "It won't happen to me." We are all at risk and the stakes are high - both for your personal and financial well-being and for the university's standing and reputation.  Cybersecurity is everyone's responsibility. By following the tips below and remaining vigilant, you are doing your part to protect yourself and others. Tip #2 - Keep software up-to-dat e Installing software updates for your operating system and programs is critical. Always install the latest security updates for your devices: Turn on Automatic Updates for your operating system. Use web browsers such as Chrome or Firefox that receive frequent, automatic security updates . Make sure to keep browser plug-ins (Flash, Java, etc.) up-to-date. Tip #3 - Avoid Phishing scams - beware of suspicious emails and phone calls Phishing scams are a constant threat - using variou...

Write a C program to find number is Abundant number or not

  Write a C program to find the number is an Abundant number or not:- In this program to find a number is an Abundant number or not. A number n is said to be an Abundant Number to follow these condition the sum of its proper di visors is greater than the number itself. And the difference between these two values is called abundance. Ex:-  Abundant number  12 having a proper divisor is 1,2,3,4,6 the sum of these factors is 16 it is greater than 12 so it is an Abundant number. Some other abundant numbers     18, 20, 24, 30, 36, 66, 70, 72, 78, 80, 84, 88, 90, 96, 100, 102, 104, 108, 112, 114, 120.. ALGORITHMS:- Step 1 - Enter the number, to find the Abundant number. Step 2 - Initialize the loop with c=1 to c<=number and follow the following calculation      (i) check if whether the number is divisible with c and c got a result zero.      (ii) now sum=sum+c, add a digit into a sum and store it in the sum. Step 3 . then the...

C Program to Check Year is a Leap Year or Not

How to Check Year is a Leap Year or Not in C:- In this program we have to find the year is a leap year or not. Generally  we assume that year is exactly divisible by 4 is a leap year. But it is not only in this case 1900 is divisible by 4. But it  is not a leap so it that case we follows these conditions    It is exactly divisible by 100 If it is divisible by 100, then it should also exactly divisible by 4 And it is divisible by 400   These all conditions are true year is a leap year. ALGORITHMS:- Step 1 . Initialize variable “year” to find leap year. Step 2 . Take input from User. Step 3 . We use this condition ((year%4==0)&&            (year%100!=0)) || (year%400==0)) to check the year is Leap or not. S tep 4 . It is true display year i...