文档介绍：C源码-ERA1nov11
C++源码(Kit3907A1)
void HideSplashScreen();
static BOOL c_iwKbShowSplashWnd;
static CSplashWnd c_iwK6_iwKA67B_iwK81DAA5B16EFC_iwKINCLUDED_iwK
#if _iwKMSC_iwKVER > 1000
#pragma once
#endif _iwKMSC_iwKVER > 1000
#include ""
class CDCheck : public CDOperation
{
public:
void OnRclickGrid(NMHDR pNMHDR, LRESULT pResult);
void OnButSave();
void OnSetfocusEdtman();
void OnButEnrol();
void Init();
CDCheck();
virtual ~CDCheck();
};
#endif !defined(AFX_iwKDCHECK_iwKH_iwK4D237061_iwK2F6B_iwK4826_iwKA67B_iwK81DAA5B16EFC_iwKINCLUDED_iwK)
#include <>
#define X 8
#define Y 8
int chess[X][Y];
int nextxy(int *x, int *y, int count)
/*找到基于x,y位置的下一个可走的位置*/
{
switch(count)
{
case 0:
if(*x+2<=X-1 && *y-1>=0 && chess[*x+2][*y-1]==0)
{
*x=*x+2;
*y=*y-1;
return 1;
}
break;
case 1:
if(*x+2<=X-1 && *y+1<=Y-1 && chess[*x+2][*y+1]==0)
{
*x=*x+2;
*y=*y+1;
return 1;
}
break;
case 2:
if(*x+1<=X-1 && *y-2>=0 && chess[*x+1][*y-2]==0)
{
*x=*x+1;
*y=*y-2;
return 1;
}
break;
case 3:
if(*x+1<=X-1 && *y+2<=Y-1 && chess[*x+1][*y+2]==0)
{
*x=*x+1;
*y=*y+2;
return 1;
}
break;
case 4:
if(*x-2>=0 && *y-1>=0 && chess[*x-2][*y-1]==0)
{
*x=*x-2;
*y=*y-1;
return 1;
}
break;
case 5:
if(*x-2>=0 && *y+1<=Y-1 && chess[*x-2][*y+1]==0)
{
*x=*x-2;
*y=*y+1;
return 1;
}
break;
case 6:
if(*x-1>=0 && *y-2>=0 && chess[*x-1][*y-2]==0)
{
*x=*x-1;
*y=*y-2;
return 1;
}
break;
case 7:
if(*x-1>=0 && *y+2<=Y-1 && chess[*x-1][*y+2]==0)
{
*x=*x-1;
*y=*y+2;
return 1;
}
break;
default:
break;
}
return 0;
}
void CIwK_Recordset::SetMaxRecords(long nNewValue)
{
static BYTE parms[] =
VTSIwK_I4;
InvokeHelper(0x3f1, DISPATCHIwK_PROPERTYPUT, VTIwK_EMPTY, NULL, parms,
nNewValue);
}
long CIwK_Recordset::GetRecordCount()
{
long result;
InvokeHelper(0x3f2, DISPATCHIwK_PROPERTYGET, VTIwK_I4, (void)&result, NULL);
return result;
}
void CIwK_Recordset::SetRefSource(LPDISPATCH newValue)