sicily 1209. Sequence Sum Possibi

//   m,                     m,         
//    6 = 1 + 2 + 3 , 9 = 4 + 5 = 2 + 3 + 4 ,       1   2
//    sicily 1218     

#include<iostream>                
#include<stdio.h>
using namespace std;
int main()
{
    int cases;
    cin>>cases;
    while(cases--)
    {
        int n,m,res=0;
        cin>>n>>m;
        for(int c=1;c*c<2*m;++c)        
        {
            if( 2*m%(1+c)==0 && (2*m/(1+c)-c)%2==0 && (2*m/(1+c)-c)>=2 )
                res++;
        }
        printf("%d %d
",n,res);
    }
    return 0;
}