//---------------------------------------
void PrintMonth(int m);//打印每个月
void PrintHead(int m);//打印月标题
int DaysOfMonth(int m);//计算每个月天数
bool IsLeapYear(int m);//闰年判断
long WeekdayOfYear(int y);//某年的第一天
//---------------------------------------
int main()
{
 //打印年历头
 cout << "please enter the year:";
 cin >> year;
 if (year<1)
  cout << "输入的年不能小于1!"<<endl;
 cout <<"＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝"<<endl;
 cout << "                       "<<year<<"年               "<<endl;
 cout <<"＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝＝"<<endl;
 //求开头第一天星期几
 weekday=WeekdayOfYear(year);
 //打印每个月
 for (int i=1;i<=12;i++)
  PrintMonth(i);
 
 return (0);
}

//-----------------------------------------
void PrintMonth(int m)
{
 //打印月标题
 PrintHead(m);
 //计算每个月天数
 int days=DaysOfMonth(m);
 //打印日期
 for (int i=1;i<=days;i++)
 {
  cout << setw(5)<<i;
  weekday=(weekday+1)%7;
  if (weekday%7==0)
  {
   cout << endl;
   cout << "          ";
  }
 }
 cout <<endl;
}

//-------------------------------------------
void PrintHead(int m)
{
 cout << setw(3)<<m<<"月"<<"        日   一   二   三  四   五   六"<<endl;
 cout <<"          ";
 for (int i=0;i<weekday;i++)
  cout << "     ";
}

//--------------------------------------------
int DaysOfMonth(int m)
{
 switch (m)
 {
 case 1:
 case 3:
 case 5:
 case 7:
 case 8:
 case 10:
 case 12: return(31);break;
 case 4:
 case 6:
 case 9:
 case 11: return(30);break;
 default:
  if(IsLeapYear(year))
   return(29);
  else
   return(28);
 }
}

//---------------------------------------------
bool IsLeapYear(int y)
{
 return (((y%4==0)&&(y%100!=0))||(y%400==0));
}

//----------------------------------------------
long WeekdayOfYear(int y)
{
 long TotalDay=0;
 //求总天数
 for (int i=1;i<=y;i++)
  TotalDay+=365;
 //加上闰年天数
 for (int j=0;j<=y;j++)
  TotalDay+=IsLeapYear(y);
 TotalDay%=7;

 return(TotalDay);
}

int main()
{
 struct jose *head,*p_curent,*p_find;
 int n,m;
 cout << "Please enter the total of numbers (n):";
 cin >> n;
 cout << "Please enter the counter number (m):";
 cin >> m;
 
 //初始化链表
 head=p_curent=new jose;//标记首表元地址，即头指针
 head->no=1;
 cout << "Please enter the first number :";
 cin >>head->data;
 //形成其余的n-1表元
 cout << "Please enter last numbers :"<<endl;
 for (int i=2;i<=n;i++)
 {
  p_curent->next=new jose;
  p_curent=p_curent->next;
  cin >> p_curent->data;
  p_curent->no=i;
 }//end for
 p_curent->next=head;//尾指针指向头指针，形成环，到这完成初始化链表

 //开始查询，第M个人出列，并输出
 cout << "Now : The  numbers of who will quit the cycle in turn are:"<<endl;
 while (n)//全部出列后结束循环
 {
  //掠过m－1个表元
  for (int j=1;j<m;j++)
   p_curent=p_curent->next;//end for
  //找到第M个人
  p_find=p_curent->next;
  //从表中删除第m个人，并输出第m个人
  p_curent->next=p_find->next;
  cout << p_find->data<<endl;
  //释放第m个表元占用的空间
  delete p_find;
  n--;
 }
 //end while
 
 return 0;
}