Cod sursa(job #1698454)
| Utilizator | Data | 4 mai 2016 15:34:18 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include<iostream>
using namespace std;
//ifstream f("date.in");
//ofstream g("date.out");
int main()
{
int n,i,j,a[100][100],b[100][100],c[100][100];
cin>>n;
for(i=1; i<=n; i++)
for(i=1; j<=n; j++) {
cin>>a[i][j];
}
for(i=1; i<=n; i++)
for(i=1; j<=n; j++) {
cin>>b[i][j];
}
for(i=1; i<=n; i++)
for(j=1; j<=n; j++)
c[i][j]+=a[i][j]*b[j][i];
for(i=1; i<=n; i++)
for(j=1; j<=n; j++)
cout<<c[i][j];
return 0;
}
