SPOJ MIXTURES / MCM - DP

/***
 created: 2022-07-22-21.52.17
***/

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template<typename U> using ordered_set=tree<U, null_type,less<U>,rb_tree_tag,tree_order_statistics_node_update>;
#define ll long long
#define test int tt; cin>>tt; for(int cs=1;cs<=tt;cs++)
#define get_lost_idiot return 0
#define nl '\n'

ll a[105];

ll dp[202][202];

ll summ(ll x, ll y)
{
    ll s=0;
    for(ll i=x;i<=y;i++)
    {
        s+=a[i];
        s%=100;
    }
    return s;
}

ll solve(ll s,ll e)
{
    if(s>=e) return 0ll;

    if(dp[s][e]!=-1) return dp[s][e];

    ll ans = 1e17;

    for(ll i=s;i<e;i++)
    {
        ll xx= solve(s,i) + solve(i+1,e);
        xx+= (summ(s,i)*summ(i+1,e));
        ans=min(ans,xx);
    }
    return dp[s][e]=ans;
}

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    ll n;

    while(cin>>n && n)
    {
        for(ll i=0;i<n;i++) cin>>a[i];

        memset(dp,-1, sizeof dp);

        cout<<solve(0,n-1)<<nl;
    }

    get_lost_idiot;
}