Most positive integers may be written as a sum of a sequence of at least two consecutive positive integers. For instance,

6 = 1 + 2 + 3
9 = 5 + 4 = 2 + 3 + 4

but 8 cannot be so written.

Write a program which will compute how many different ways an input number may be written as a sum of a sequence of at least two consecutive positive integers.

The first line of input will contain the number of problem instances N on a line by itself, (1 ≤ N ≤ 1000) . This will be followed by N lines, one for each problem instance. Each problem line will have the problem number, a single space and the number to be written as a sequence of consecutive positive integers. The second number will be less than 2³¹ (so will fit in a 32-bit integer).

The output for each problem instance will be a single line containing the problem number, a single space and the number of ways the input number can be written as a sequence of consecutive positive integers.

#include <stdio.h>

#include <iostream>

#include <string.h>

#include <math.h>

using namespace std;

int main()

{

    int nCase, index, n;

    scanf("%d", &nCase);

    while (nCase--)

    {

        int ans = ;

        scanf("%d%d", &index, &n);

        for (int i = ; i <= sqrt((double)n * 2.0); i++)

        {

            if ((n - i * (i - ) / ) % i == )

            {

                ans++;

            }

        }

        printf("%d %d\n", index, ans);

    }

    return ;

}