HJ69 矩阵乘法

#include <iostream>
#include <vector>
using namespace std;

int main() {
	int x, y, z;
	cin >> x; cin >> y; cin >> z;
	vector<vector<int>> vec1(x, vector<int>(y, 0));
	vector<vector<int>> vec2(y, vector<int>(z, 0));

	int i = 0, j = 0, num;
	char c;
	int tempX = x;
	while (tempX--) {
		while ((cin >> num).get(c)) {
			vec1[j][i] = num;
			i++;
			if (c == '\n') break;
		}
		j++;
		i = 0;
	}

	c = ' '; i = 0; j = 0;
	int tempY = y;
	while (tempY--) {
		while ((cin >> num).get(c)) {
			vec2[j][i] = num;
			i++;
			if (c == '\n') break;
		}
		j++;
		i = 0;
	}

	int sum = 0, k;
	i = 0; j = 0;
	for (i = 0; i < x; ++i) {
		for (k = 0; k < z; ++k) {
			for (j = 0; j < y; ++j) {
				sum += (vec1[i][j] * vec2[j][k]);
			}
			cout << sum << " ";
			sum = 0;
		}
		cout << endl;
	}
}