Categories: C

Miscellaneous Program(exponential without using pow() method)

Without using the pow() method, here is a program to find exponential.

Long long int is twice as big as long int.

The format specifier for long long int is % lld.

#include<stdio.h>
int main()
{
    long long int value = 1;
   int n,exp;
    printf("Enter the number and its exponential:\n\n");
    scanf("%d%d",&n, &exp);

   int exp1 = exp;   
    while(exp-- > 0)
    {
        value *= n; // multiply n to itself exp times
    }

    printf("\n\n %d^%d = %lld\n\n", n, exp1, value);
   return 0;
}

Output:

input is 2 and 3.

Enter the number and its exponential:

2 3
2^3 = 8

input is 12.

Enter the number and its exponential:

12 2
12^2 = 144

Note: also read about the Miscellaneous Program(Armstrong Number)

Follow Me

If you like my post please follow me to read my latest post on programming and technology.

https://www.instagram.com/coderz.py/

https://www.facebook.com/coderz.py

Share
Published by
Rabecca Fatima

Recent Posts

Generate Parenthesis | Intuition + Code | Recursion Tree | Backtracking | Java

Problem Statement: Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses. Example…

2 months ago

Square Root of Integer

Given an integer A. Compute and return the square root of A. If A is…

1 year ago

Build Array From Permutation

Given a zero-based permutation nums (0-indexed), build an array ans of the same length where…

1 year ago

DSA: Heap

A heap is a specialized tree-based data structure that satisfies the heap property. It is…

1 year ago

DSA: Trie

What is a Trie in DSA? A trie, often known as a prefix tree, is…

1 year ago

Trees: Lowest Common Ancestor

What is the Lowest Common Ancestor? In a tree, the lowest common ancestor (LCA) of…

1 year ago