maochilaoshu2.cpp

这是一个猫吃老鼠问题的改进算法。

#include "malloc.h"
#include <iostream.h>
int main(int argc, char* argv[])
{
    cout<<"请输入老鼠的总数:";
    int itotal;        
    cin>>itotal;
    int iyu=itotal;   
    int ipoint=0;  
int ijian=1;   
int * ipArray;  

if(iyu<1)
{
cout<<"老鼠数不能小于1!"<<endl;
return 0;
}
if(iyu==1)   
{
cout<<"  "<<ipoint+1<<endl;
cout<<"结束!"<<endl;
return 0;
}

cout<<"共 "<<itotal<<"个老鼠!"<<endl;
        cout<<"以下是吃老鼠的顺序输出过程:"<<endl;

ipArray=new int[iyu];  
for(int i=0;i<iyu;i++)    
{ 
ipArray[i]=1;          
}


for(;;)  
{
                ipoint=ipoint%itotal;  
if(iyu==1)   
{
if((ipArray[ipoint]==1))   
{
cout<<"  "<<(ipoint+1)<<endl;
cout<<"结束!"<<endl;
break; 
}
}
else
{
if((ipArray[ipoint]==1))   
{
if(ijian==1)  
{
cout<<"  "<<(ipoint+1)<<endl;   
ipArray[ipoint]=0;  
ijian=0;            
iyu--;             
}
else     
{
ijian=1;    
}
}//endif
}//endofelse
ipoint++;    
}//endfor
return 0;
}