C 语言 狐狸找兔子问题

#include 
#include

class MountainHole
{
public:
MountainHole(int _id, int _count)
{
id = _id;
count = _count;
}
~MountainHole(){}
int id;
int count;
};

int main(int argc, const char * argv[]) {

std::vector<MountainHole*> lstHole;

for (int i = 0; i < 10; i++) {
    MountainHole* m = new MountainHole(i+1, 0);
    lstHole.push_back(m);
}

int current = 0;

for (int j = 0 ; j < 1000; j++ )
{
    current = current%10;
    lstHole[current]->count ++;

    printf("第%d次, 访问了第%d个洞\n", j+1, current+1);
    current += (j+1);
}

for (int n = 0; n < 10; n ++) {
    printf("第%d个洞被访问过的次数：[%d]\n", lstHole[n]->id, lstHole[n]->count);
}

return 0;
}