Cod sursa(job #2576956)

Utilizator MihclerioVladimir Chim Mihclerio Data 7 martie 2020 19:09:22
Problema Arbori indexati binar Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.13 kb
#pragma GCC optimize("Ofast")
/*
       /\__/\
      ( • - •)
        /  >🍪

  why hack me, better eat a cookie
*/
#include<bits/stdc++.h>

#define Plan_B() cout<<"HESOYAM"

#define all(s) s.begin(),s.end()
#define rc(x) return cout<<x,0

#define pb push_back
#define mp make_pair
#define fr first
#define sc second

typedef long long ll;

const int nmax=100+3;
const ll mod=998244353;
const ll inf=2e9+3;

using namespace std;

#define DEBUG

int t[nmax][nmax],ver[nmax][nmax],hor[nmax][nmax];

int main()
{
#ifdef DEBUG
  freopen("1.in","r",stdin);
  freopen("1.out","w",stdout);
#endif
  mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
  ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);

  int n,m,k;
  cin>>n>>m>>k;
  int a[n+3],b[m+3];
  int ans=0;
  for(int i=1;i<=n;i++) cin>>a[i];
  for(int i=1;i<=m;i++) cin>>b[i];
  for(int i=1;i<=n;i++)
  for(int j=1;j<=m;j++) t[i][j]=a[i]*b[j];
  for(int i=1;i<=n;i++)
  for(int j=1;j<=m;j++) t[i][j]+=t[i][j-1];
  for(int i=1;i<=n;i++)
  {
    for(int j=1;j<=m;j++) cout<<t[i][j]<<" ";
    cout<<"\n";
  }
}