Pagini recente » Cod sursa (job #1759068) | Cod sursa (job #2519732) | Cod sursa (job #662566) | Cod sursa (job #1470450) | Cod sursa (job #1526374)
#include <cstdio>
using namespace std;
int v[505], c[505][505];
int main()
{
FILE *in, *out;
in = fopen("podm.in", "r");
out = fopen("podm.out", "w");
int i, j, k, var, n, min = 2000000000;
fscanf(in, "%d", &n);
for(i = 1; i <= n; i++)
fscanf(in, "%d", &v[i]);
//c[i][j] = nr minim de operatii din inmutltire
for(i = 2; i <= n; i++)
{
for(k = ; k <= n; k++)
c[i][i+k] = v[i-1] * v[i] * v[i+k];
}
for(i = 1; i<= n; i++)
{
for(j = 1; j <= n; j++)
{
for(k = 1; k <= n; k++)
{
var = c[i][k] + c[k+1][j] + v[i-1]*v[k] * v[j];
if( var < min)
min = var;
}
c[i][j] = min;
}
}
fprintf(out, "%d\n", c[1][n]);
for(i = 1; i<= n; i++)
{
for(j = 1; j <= n; j++)
{
fprintf(out, "%d ", c[i][j]);
}
fprintf(out, "\n");
}
return 0;
}