herrDeng網內搜尋
自訂搜尋
熱門文章
-
url="https://www.twse.com.tw/exchangeReport/STOCK_DAY?response=json&date=20220330&stockNo=2330"
-
連續複利
-
py3 cpp Line sweep解Leetcode 3346 Maximum Frequency of an Element After Performing Operations I 使用 line sweep不用排序，可得線性解 [Py3解請進]
-
請用Random產生20個0~99的奇數(可重複)，然後排序
-
C++ py3 C Rust adjacent difference與loop速解Leetcode 1526 Minimum Number of Increments on Subarrays to Form a Target Array [Py3一行解請進]
-
輸入公元n年，輸出"平年" "閏年"
-
int a[]={21, 23, 57, 13 ,17, 6}; float average; average=?
2 則留言:
friend Matrix operator^(Matrix& A, Matrix& B)
{
Matrix C(A.row, A.col);
for (int i = 0; i < A.row; i++) {
for (int j = 0; j < A.col; j++)
C(i, j) = (T)((T)A(i, j) ^ (T)B(i, j));
}
return C;
}
friend Matrix& operator*(Matrix A, Matrix B)
{
for (int i = 0;i < A.row;i++) {
for (int j = 0;j < B.col;j++) {
C(i, j) = 0;
for (int k = 0;k <A.col;k++)
C(i, j) += A(i, k)*B(k, j);
}
}
return C;
}
friend Matrix operator^(Matrix& A, Matrix& B)
{
Matrix C(A.row, A.col);
for (int i = 0; i < A.row; i++) {
for (int j = 0; j < A.col; j++)
C(i, j) = (T)((T)A(i, j) ^ (T)B(i, j));
}
return C;
}
friend Matrix& operator*(Matrix A, Matrix B)
{
for (int i = 0;i < A.row;i++) {
for (int j = 0;j < B.col;j++) {
C(i, j) = 0;
for (int k = 0;k <A.col;k++)
C(i, j) += A(i, k)*B(k, j);
}
}
return C;
}
張貼留言