POJ 2528

#include<iostream>
#define MAXN 10001
using namespace std;

struct _node
{
    int b;
    int e;
};

void discreat(int l,int r,int index);
_node _m[MAXN];
int n;
bool boo;
int main()
{
    //freopen("acm.acm","r",stdin);
    int test;
    int i;
    int ans;
    //cin>>test;
    scanf("%d",&test);
    while(test --)
    {
        ans = 0;
        //cin>>n;
        scanf("%d",&n);
        for(i = 0; i < n; ++ i)
        {
            //cin>>_m[i].b>>_m[i].e;
            scanf("%d%d",&_m[i].b,&_m[i].e);
        }
        for(i = 0; i < n; ++ i)
        {
            boo = false;
            discreat(_m[i].b,_m[i].e,i+1);
            if(boo)
                ++ ans;
        }
        cout<<ans<<endl;
    }
}

void discreat(int l,int r,int index)
{
    if(index == n)
    {
        boo = true;
        return;
    }
    if(l >= _m[index].b && r <= _m[index].e)
    {
        return;
    }
    if(r < _m[index].b || l > _m[index].e)
    {
        discreat(l,r,index + 1);
        return;
    }
    if(l < _m[index].b)
    {
        discreat(l,_m[index].b - 1,index + 1);
        //return 0;
    }
    if(r > _m[index].e)
    {
        discreat(_m[index].e + 1,r,index + 1);
    }
    return;
}