fork download
  1. #include<bits/stdc++.h>
  2. using namespace std;
  3. #define fi first
  4. #define se second
  5. #define ll long long
  6. #define ull unsigned long long
  7. #define pll pair<ll,ll>
  8. #define pb push_back
  9. #define emb emplace_back
  10. #define lg(x) __lg(x)
  11. #define all(s) s.begin(),s.end()
  12. #define name "test"
  13. #define Mask(i) (1LL<<i)
  14. #define testbit(mask, i) ((mask >> i) & 1LL)
  15. #define onBit(mask, i) (mask | (1LL << i))
  16. #define offBit(mask, i) (mask & ~(1LL << i))
  17. #define flipBit(mask, i) (mask ^ (1LL << i))
  18. #define showbit(mask, x) bitset<x>(mask)
  19. const ll mod = 1e9 + 7;
  20.  
  21. void add(ll &a, ll b){
  22. if((a += b) >= mod) a -= mod;
  23. }
  24.  
  25.  
  26. const ll inf = 1e18;
  27. const ll lim = 1e7 + 5;
  28. const ll N = 500 + 5;
  29.  
  30. float a[N][N];
  31. float b[N][N];
  32. float c[N][N];
  33. int main()
  34. {
  35. ios_base::sync_with_stdio(0);
  36. cout.tie(0);cin.tie(0);
  37. if(fopen(name".inp","r")){
  38. freopen(name".inp","r",stdin);
  39. freopen(name".out","w",stdout);
  40. }
  41.  
  42. int n, m; cin >> n >> m;
  43. for(int i = 1; i <= n; i++)
  44. for(int j = 1; j <= m; j++)
  45. cin >> a[i][j];
  46. int l, k; cin >> l >> k;
  47. for(int i = 1; i <= l; i++)
  48. for(int j = 1; j <= k; j++)
  49. cin >> b[i][j];
  50.  
  51. for(int i = 1; i <= n; i++)
  52. for(int j = 1; j <= k; j++)
  53. for(int u = 1; u <= m; u++)
  54. c[i][j] = c[i][j] + a[i][u] * b[u][j];
  55.  
  56. for(int i = 1; i <= n; i++){
  57. for(int j = 1; j <= k; j++){
  58. cout << c[i][j] << " ";
  59. }cout << '\n';
  60. }
  61. }
  62.  
  63.  
  64.  
  65.  
  66.  
  67.  
  68.  
  69.  
  70.  
  71.  
  72.  
  73.  
Success #stdin #stdout 0s 544KB
stdin
Standard input is empty
stdout