Код:#include <windows.h>#include <stdio.h>#include <conio.h>int field1010 = 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0;void findMaxRectint iArray, int nSize;int mainint argc, char argv findMaxRectfield0, 10; return 0;int compare const void arg1, const void arg2 return int arg1 - int arg2;void findMaxRectint iArray, int nSize DWORD dwSize = sizeofint3nSizenSize 4nSize 4; void field = VirtualAllocNULL,dwSize,MEM_RESERVEMEM_COMMIT MEM_TOP_DOWN,PAGE_READWRITE; int ipAr = int field nSize 3; int i, j; fori=0; i<nSize; i forj=0; j<nSize; j ipAr = iArray; ipAr; iArray; ipAr=2; ipAr = int field nSize 3; int maxItemCnt = 0; int iCurRes = int field nSizenSize 4nSize 4; int iMaxRes = iCurRes nSizenSize; int nSize2 = nSize 2; fori=1; i<nSize-1; i forj=1; j<nSize-1; j ifipAr==1 ipAr = 0; iCurRes = intipAr; int iCurResLimit = iCurRes; int iCnt = 1; int iItem = iCurRes; whileiItem<=iCurResLimit int ip = int iItem - nSize2; ifip==1 ip = 0; iCurResLimit; iCurResLimit = intip; iCnt; ip = int iItem 1; ifip==1 ip = 0; iCurResLimit; iCurResLimit = intip; iCnt; ip = int iItem nSize2; ifip==1 ip = 0; iCurResLimit; iCurResLimit = intip; iCnt; ip = int iItem - 1; ifip==1 ip = 0; iCurResLimit; iCurResLimit = intip; iCnt; iItem; ifmaxItemCnt<iCnt maxItemCnt = iCnt; CopyMemoryiMaxRes, iCurRes, sizeofintiCnt; ipAr; ipAr=2; printf"Число ячеек: dnn", maxItemCnt; qsortvoid iMaxRes, maxItemCnt, sizeofint, compare; forint k=0; k<maxItemCnt; k j = iMaxRes - intfield>>2; i = j/nSize2; j-= inSize2 - 1; i--; printf"Ячейка d, dn", i, j; iMaxRes; printf"nНажмите любую клавишу...n"; VirtualFreefield, 0, MEM_RELEASE; getch;
--------------------
работа в отелях греции
|
••• Разминка для ума •••, Попробуйте решить головоломку...
