题目:有N队进行循环赛,用程序排出赛程表
#include <vector>
#include <stack>
#include <algorithm>
#include ""
struct _ComNode //比赛节点
{
int m_nHost; //主场
int m_nGuest; //客场
};
typedef std::vector<_ComNode *> _ComList; //比赛列表
typedef std::vector<_ComNode *> _Row; //一行数据
typedef std::stack<_Row *> _ResultStack; //结果列表
typedef _ComList::iterator _ComListItor;
typedef _Row::iterator _RowItor;
typedef std::vector<int> _TemList;
_ComList List;
_ComList TemList;
_ResultStack g_ResultStack; //结果栈
_TemList g_TemList;
int g_nNum = 14;
int g_nRandPos = 0;
void List()
{
for( int i=0; i<g_nNum; ++i )
{
for( int j=0; j<g_nNum; ++j )
{
if( i != j )
{
_ComNode *pNode = new _ComNode;
pNode->m_nHost = i;
pNode->m_nGuest = j;
( pNode );
}
}
}
for( i=0; i<g_nNum; ++i )
{
for( int j=0; j<g_nNum-1; ++j )
{
_ComNode *pNode = List[i*(g_nNum-1)+j];
printf( " (%d, %d) ", pNode->m_nHost, pNode->m_nGuest );
}
printf( "\n" );
}
printf( "\n\n" );
题目有n队进行循环赛,用程序排出赛程表 来自淘豆网www.taodocs.com转载请标明出处.