Number of substrings divisible by 8 but not by 3
Submissions: 231   Accuracy:

17.25%

  Difficulty: Easy   Marks: 2

Given a string of digits “0-9”. The task is find the number of substrings which are divisible by 8 but not by 3.

 

Input:

The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. The first line of each test case contains an integer N denoting the length of the numeric string.

The second line of each test case contains the numeric string.


Output:

Print the answer for each testcase in a new line.


Constraints:

1<= T <=100

1<= N <=10000


Example:

Input:

2

3

888

10

6564525600

Output:

5

15

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

Contributor: Sujnesh Mishra
Author: sujnesh


If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.



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

to report an issue on this page.