BETA

Difficulty Level: Easy

Total Submissions: 1616 Accuracy:

15.9%

Product Sum
     

Given two integers a and b. Write a program to find the number of digits in the product of these two integers.

Input:
First line contains an integer T denoting number of test cases. The next T lines contains 2 space separated integers a and b each.


Output:
For each test case print the number of digits in the product of the two numbers.

Constraints:
1<=T<=10^5
-10^5<=a,b<=10^5

Example:

Input:
2
12 4
-24 33
Output:
2
3

** For More Input/Output Examples Use 'Expected Output' option **

Contributor: ShivamKD

Set Default Code

					   
It is recommended to 'Compile & Test' your code before clicking 'Submit'!

Compilation/Execution Result:

Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.