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:


Try your Solution

Strongly recommended to Solve it on your own, Don't directly go to the solution given below.

#include<stdio.h> int main() { //write your code here }

Program or Solution

int main()
	int num,n,output1,output2;
	printf("Enter a number and number of shifts:");
	scanf("%d %d",&num,&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)