struct ListNode
{
      int       m_nKey;
      ListNode* m_pNext;
};

int FindCoundDownInList(pListNode head,int num)
{
    pListNode p1,p2;
    p1=p2=head;
    while(num-->0 && p1!=NULL) 
        p1=p1->m_pNext;
    if(p1==NULL) 
        return 0;
    else{
        while(p1!=NULL)
        {
            p1=p1->m_pNext;
            p2=p2->m_pNext;
        }
    return p2->m_nKey;
    }
}