代码

// fileName: test_O0_Unroll_loops_13_type_2.cpp
#pragma GCC optimize("O0")

#include <cstdio>
#include <random>
#include <chrono>

std::mt19937 rng(std::chrono::steady_clock::now().time_since_epoch().count());

typedef unsigned int UI;
typedef unsigned long long ULL;

const UI Mod = 998244353;
const int N = 1200;

UI A[N][N], B[N][N], C[N][N];

void Mul() {
	for (int i = 0; i < N; ++i)
		for (int j = 0; j < N; ++j) {
			int k = 0;
			for ( ; k + 12 < N; k += 13)
				C[i][j] = (C[i][j] + (ULL)A[i][k] * B[j][k] +
				(ULL)A[i][k + 1] * B[j][k + 1] +
				(ULL)A[i][k + 2] * B[j][k + 2] +
				(ULL)A[i][k + 3] * B[j][k + 3] +
				(ULL)A[i][k + 4] * B[j][k + 4] +
				(ULL)A[i][k + 5] * B[j][k + 5] +
				(ULL)A[i][k + 6] * B[j][k + 6] +
				(ULL)A[i][k + 7] * B[j][k + 7] +
				(ULL)A[i][k + 8] * B[j][k + 8] +
				(ULL)A[i][k + 9] * B[j][k + 9] +
				(ULL)A[i][k + 10] * B[j][k + 10] +
				(ULL)A[i][k + 11] * B[j][k + 11] +
				(ULL)A[i][k + 12] * B[j][k + 12]) % Mod;
			for ( ; k < N; ++k)
				C[i][j] = (C[i][j] + (ULL)A[i][k] * B[k][j]) % Mod;
		}
}

#ifdef PKRBT
int main() {
#else
void matrix_multiply(int, const double *, const double *, double *) {
#endif
	for (int i = 0; i < N; ++i) {
		for (int j = 0; j < N; ++j) {
			A[i][j] = rng() % Mod;
			B[i][j] = rng() % Mod;
			C[i][j] = 0;
		}
	}
	Mul();
	UI Ans = 0;
	for (int i = 0; i < N; ++i)
		for (int j = 0; j < N; ++j)
			Ans ^= C[i][j];
	printf("%u\n", Ans);
#ifdef PKRBT
	return 0;
#endif
}

评测结果