num_extract.cpp

#include<bits/stdc++.h>

using namespace std ;
#define M 100
#define pf printf
#define sf scanf
#define sf1(x) scanf("%d",&x)
#define sf2(x,y) scanf("%d %d",&x,&y)
#define pf1(x) printf("%d\n",x)
#define pf2(x,y) printf("%d %d\n",x,y)
#define rep(i,n) for(i = 0 ;i< n ; i++)
#define pb push_back

typedef long long ll ;

vector<int > data;

int arr[100] , m_arr[100] ,temp[100];

int ex_num(char s1[] )
{
    int i , j , k;
    int len ;
    i = 0;
    j = len = strlen(s1) - 1 ;
    len =  strlen(s1);
    while(1)
    {
        if(s1[i] != ' ') break;
        i++;

    }
    while(1)
    {
        if(s1[j] != ' ')break;
        j--;

    }
    char s2[1000];

    int flag = 0;
    int count = 0;
    for(k = i ; k<= j ; k++)
    {
        if(s1[k] != ' ') flag =1 ;
        else flag = 0;

        if(flag == 1 )
        {
            s2[count++] =  s1[k];
            if(s1[k+1] == ' ') s2[count++] = s1[k+1];

        }
    }
    s2[count++] = ' ';
    s2[count] = 0;
    k= 0 ;
    int num  = 0;
    for(i = 0 ; i < count ; i++ )
    {
        if(s2[i] == ' ')
        {
            if(num != 0)
                arr[k++] = num ;
            // pf("num ,,,,%d %d\n",num , i );
            num = 0;
        }
        else
        {
            num =  num*10 + s2[i]-'0';

        }
    }

    return k;
}

int main()
{
    int i, j , k, tc ;
    sf1(tc);
    getchar();
    while(tc--)
    {
        char s[100];
        gets(s );
        k = call( s);
        pf("%d", k);
        for(i = 0 ; i<= k ; i++)
            pf("%d ", arr[i]);
        pf("\n");


    }


    return 0;
}