//copyright?software?school?Lijianeng???student?ID:12330163
//multi-thread?programming?using?win32?API?
#include?
#include?
#include?
#include?
#include?
using?namespace?std;
struct?v?{
	int?i;//row
	int?j;//column
};
int?mnk;
int?a[20][20]b[20][20]c[20][20];//創(chuàng)建一些空間來(lái)存放矩陣，所以矩陣計(jì)算限于20*20以內(nèi)?
DWORD?WINAPI?matrix（LPVOID?parameter）;
int?count?=?1;//用于記錄第幾個(gè)線程在運(yùn)行?
int?main（）{
	ifstream?inputfile（“input.txt“）;//從文件讀取矩陣，如果需要修改請(qǐng)到input.txt中修改?
	if（!inputfile）{
		printf（“Input?file?open?error!“）;
		exit（1）;
	}
	inputfile?>>?m?>>?n?>>?k;
	for（int?i=0;i		for（int?j=0;j			inputfile?>>?a[i][j];
		}
	}
	for（int?i=0;i		for（int?j=0;j			inputfile?>>?b[i][j];
		}
	}
	
	HANDLE?threadHandle[m][k];//對(duì)每個(gè)線程創(chuàng)建一個(gè)HANDLE，并且wait到所有線程結(jié)束后才將結(jié)果存至文件?
	for（int?i=0;i		for（int?j=0;j			struct?v*data?=?（struct?v*）malloc（sizeof（struct?v））;
			data->i?=?i;