# C Program to Compare M * pow(2,n) and M<<N

Get number n and m, left shit the bits of n for m times:

Sample Input 1:

4 1

Sample Output 1:

8

#### Program or Solution

#include<stdio.h> #include<math.h> int main() { int num,n,output1,output2; printf("Enter a number and number of shifts:"); scanf("%d %d",&num,&n); output1=num<<n; output2=num*pow(2,n); printf("%d %d",output1,output2); return 0; }

#### Program Explanation

left shift is equal to multiply a number with 2, left shift by n is equal to multiply with pow(2,n)