约瑟夫问题的多态性实现，哪里出现问题了呢？

Question

#include<iostream>
using namespace std;

class CPirate 
{
public:
    virtual void Jump()=0;
    CPirate * next;
};

class CAmerican:public CPirate  
{
private:
    static int remainNumber;           
    //以下请自行定义函数或数据成员
public:
    CAmerican()
    {
        remainNumber++;
    }
    void Jump()
    {
        remainNumber--;
        cout<<"I am American "<<remainNumber<<endl;
    }
};
int CAmerican::remainNumber=0;
class CEnglish: public CPirate       
{
     static int remainNumber;
public:
     //以下请自行定义函数或数据成员
     CEnglish()
    {
        remainNumber++;
    }
    void Jump()
    {
        remainNumber--;
        cout<<"I am English "<<remainNumber<<endl;
    } 
 };
int CEnglish::remainNumber=0;
class CItalian: public CPirate
{
static int remainNumber;
public:
     //以下请自行定义函数或数据成员
     CItalian()
    {
        remainNumber++;
    }
    void Jump()
    {
        remainNumber--;
        cout<<"I am Italian "<<remainNumber<<endl;
    } 
};
int CItalian::remainNumber=0;
class CJapanese: public CPirate
{
    static int remainNumber;
public:
     //以下请自行定义函数或数据成员
     CJapanese()
    {
        remainNumber++;
    }
    void Jump()
    {
        remainNumber--;
        cout<<"I am Japanese "<<remainNumber<<endl;
    } 
};
int CJapanese::remainNumber=0;
class CFrench: public CPirate
{
    static int remainNumber;
public:
     //以下请自行定义函数或数据成员
     CFrench()
    {
        remainNumber++;
    }
    void Jump()
    {
        remainNumber--;
        cout<<"I am French "<<remainNumber<<endl;
    } 
};
int CFrench::remainNumber=0;
int main()
{
    int numberPirate;
    int callID;
    char nationality;
    cin >> numberPirate>>callID;
    CPirate * pHead, *current, *p,*previous;
    //建立链表环
    for (int n = 0;n < numberPirate; ++n)
    {
        cin >> nationality;
        if (nationality=='a')
            p = new CAmerican;
        else if (nationality == 'j')
            p = new CJapanese;
        else if (nationality == 'f')
            p = new CFrench;
        else if (nationality == 'e')
            p = new CEnglish;
        else
            p = new CItalian;
        if (n==0)
        { 
            pHead = p; 
            current = p;
        }
        else
        {
            current->next = p;
            current = p;
        }
    }
    current->next = pHead;
    // 开始跳海游戏
    previous = current;
    current = pHead;
    int i = 1;
    while (current!=previous)
    {
        if (i!=callID) //不跳
        {
            previous = current; 
            current = current->next;
            i++;
        }
        else //跳
        {
            previous->next = current->next;
            current->Jump();
            delete current;
            current = previous->next;
            i = 1;
        }
    }
    return 0;
}

Answer 1

仅供参考：
数据结构对单链表进行数据排序 http://bbs.csdn.net/topics/392201633