Go: package main

import (
	"bufio"
	_ "container/heap"
	"fmt"
	"os"
	_ "sort"
	"strconv"
)

// I/O
type Scanner struct {
	sc *bufio.Scanner
}

func NewScanner() *Scanner {
	sc := bufio.NewScanner(os.Stdin)
	sc.Split(bufio.ScanWords)
	sc.Buffer(make([]byte, 1024), int(1e+9))
	return &Scanner{sc}
}

func (s *Scanner) nextStr() string {
	s.sc.Scan()
	return s.sc.Text()
}

func (s *Scanner) nextInt() int {
	i, e := strconv.Atoi(s.nextStr())
	if e != nil {
		panic(e)
	}
	return i
}

func (s *Scanner) nextFloat() float64 {
	f, e := strconv.ParseFloat(s.nextStr(), 64)
	if e != nil {
		panic(e)
	}
	return f
}

func (s *Scanner) nextRuneSlice() []rune {
	return []rune(s.nextStr())
}

func (s *Scanner) nextIntSlice(n int) []int {
	res := make([]int, n)
	for i := 0; i < n; i++ {
		res[i] = s.nextInt()
	}
	return res
}

func (s *Scanner) nextFloatSlice(n int) []float64 {
	res := make([]float64, n)
	for i := 0; i < n; i++ {
		res[i] = s.nextFloat()
	}
	return res
}

// Arithmetic
func max(nums ...int) int {
	m := nums[0]
	for _, i := range nums {
		if m < i {
			m = i
		}
	}
	return m
}

func min(nums ...int) int {
	m := nums[0]
	for _, i := range nums {
		if m > i {
			m = i
		}
	}
	return m
}

func abs(x int) int {
	if x > 0 {
		return x
	}
	return -x
}

func pow(x, y int) int {
	res := 1
	for i := 0; i < y; i++ {
		res *= x
	}
	return res
}

func ceil(a, b int) int {
	if a%b == 0 {
		return a / b
	} else {
		return a/b + 1
	}
}

func gcd(a, b int) int {
	if b == 0 {
		return a
	}
	return gcd(b, a%b)
}

func lcm(a, b int) int {
	return a / gcd(a, b) * b
}

// Sort
type RuneSlice []rune

func (a RuneSlice) Len() int           { return len(a) }
func (a RuneSlice) Less(i, j int) bool { return a[i] < a[j] }
func (a RuneSlice) Swap(i, j int)      { a[i], a[j] = a[j], a[i] }

// Main
const MOD = int(1e+9) + 7
const INF = 1 << 60

func main() {
	sc := NewScanner()
	wtr := bufio.NewWriter(os.Stdout)
	defer wtr.Flush()
	for true {
		N, M := sc.nextInt(), sc.nextInt()
		if N == 0 && M == 0 {
			break
		}
		C := sc.nextIntSlice(M)
		X := sc.nextIntSlice(N)
		dp := make([][256]int, N+1)
		for i := 0; i < N+1; i++ {
			for j := 0; j < 256; j++ {
				dp[i][j] = INF
			}
		}
		dp[0][128] = 0
		for i := 0; i < N; i++ {
			for j := 0; j < 256; j++ {
				if dp[i][j] == INF {
					continue
				}
				for k := 0; k < M; k++ {
					nex := j + C[k]
					if nex < 0 {
						nex = 0
					}
					if nex > 255 {
						nex = 255
					}
					dp[i+1][nex] = min(dp[i+1][nex], dp[i][j]+pow(X[i]-nex, 2))
				}
			}
		}
		ans := INF
		for i := 0; i < 256; i++ {
			ans = min(ans, dp[N][i])
		}
		fmt.Fprintln(wtr, ans)
	}
}

C++: #include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;

int c[30],x[30000];
int dp[300000][256];

int sq(int x) {
    return x*x;
}
int add(int x, int y) {
    return max(0, min(255, x+y));
}
int main(void) {
    while(1) {
        int n,m;
        scanf("%d%d",&n,&m);
        if(!n) break;
        memset(dp, 0x6F, sizeof(dp));

        for(int i=0; i<m; i++)
            scanf("%d",&c[i]);
        for(int i=0; i<n; i++)
            scanf("%d",&x[i]);

        for(int i=0; i<256; i++)
            dp[0][i] = 0xFFFFFF;
        dp[0][128] = 0;

        for(int i=0; i<n; i++)
            for(int j=0; j<256; j++)
                for(int k=0; k<m; k++)
                    dp[i+1][add(j,c[k])] = min(dp[i+1][add(j,c[k])], dp[i][j] + sq(x[i]-add(j,c[k])));

        int res=0xFFFFFF;
        for(int j=0; j<256; j++)
            res = min(res, dp[n][j]);

        printf("%d\n", res);

    }
    return 0;
}

C++: #include<bits/stdc++.h>

#define INF 1e9
#define llINF 1e18
#define MOD 1e9+7
#define pb push_back
#define mp make_pair 
#define F first
#define S second
#define ll long long
#define sqr(x) (x)*(x)
using namespace std;
vector<int>C(20);
vector<int>x(50000);
ll ans=0;
int n,m;
int main(){
  while(cin>>n>>m,n){
    ans=llINF;
    ll dp[n+2][530]={};
    for(int i=0;i<n+2;i++)
      for(int j=0;j<520;j++)
	dp[i][j]=llINF;
    for(int i=0;i<m;i++)
      cin>>C[i];
    for(int i=0;i<n;i++){
      cin>>x[i];
      x[i]+=260;
    }

    dp[0][128+260]=0;
    for(int i=1;i<=n;i++){
      for(int j=5;j<=515;j++){
	if(dp[i-1][j]!=llINF){
	  for(int k=0;k<m;k++){
	    int num=j+C[k];
	    if(num>=515)num=515;
	    else if(num<=5)num=5;
	    //cout<<i<<" "<<
	    dp[i][num]=min(dp[i-1][j]+sqr((num-x[i-1])),dp[i][num]);
	  }
	}
      }
    }
    for(int i=0;i<520;i++){
      ans=min(dp[n][i],ans);
    }
    cout<<ans<<endl;
  }
  return 0;
}

C++: #include <stdio.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
using namespace std;
#define mp make_pair
#define pb push_back
#define rep(i,n) for(int i=0;i<n;i++)
#define repn(i,n) for(int i=1;i<=n;i++)
typedef long long ll;

ll dp[300][20005];
int n,m,c[305],x[20005];

int main(){
    while(1){
        cin>>n>>m;
        if(n==0 && m==0) return 0;
        for(int i=1;i<=m;i++) cin>>c[i];
        for(int i=1;i<=n;i++) cin>>x[i];
        rep(i,300) rep(j,20005){
            dp[i][j] = 1e18;
        }
        dp[128][0] = 0;
        for(int j=0;j<n;j++){
            for(int i=0;i<300;i++){
                if(dp[i][j] > 1e17) continue;
                repn(k,m){
                    int nxt = i+c[k];
                    nxt = max(nxt,0);
                    nxt = min(nxt,255);
                    dp[nxt][j+1] = min(dp[nxt][j+1],dp[i][j]+1LL*(nxt-x[j+1])*(nxt-x[j+1]));
                }
            }
        }
        ll ans = 1e18;
        rep(i,300) ans = min(ans,dp[i][n]);
        cout << ans << endl;
    }
}

C++: #include "bits/stdc++.h"
using namespace std;
#define mod 1000000007
#define all(c) begin(c),end(c)
template <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template <typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }
using ll = long long;
int dd[] = { 0, 1, 0, -1, 0 }; //→↓←↑

void solve()
{
	int N, M;
	while (true)
	{
		cin >> N >> M;
		if (N == 0 && M == 0)break;
		vector<int> C = vector<int>(M);
		for (int i = 0; i < M; i++)
		{
			cin >> C[i];
		}
		vector<vector<ll>> dp = vector<vector<ll>>(N + 1, vector<ll>(256, LLONG_MAX / 3));
		dp[0][128] = 0;
		int x;
		for (int i = 0; i < N; i++)
		{
			cin >> x;
			for (int j = 0; j < 256; j++)
			{
				for (int k = 0; k < M; k++)
				{
					int l = min(max(j + C[k], 0), 255);
					chmin(dp[i + 1][l], dp[i][j] + (x - l) * (x - l));
				}
			}
		}
		ll ans = LLONG_MAX;
		for (int i = 0; i < 256; i++)
		{
			chmin(ans, dp[N][i]);
		}
		cout << ans << endl;
	}
}

int main()
{
	cin.tie(0);
	ios::sync_with_stdio(false);
	solve();
	return 0;
}

C++: #include <vector>
#include <iostream>
#include <algorithm>
using namespace std;

const int INF = 1 << 29;

int clamp(int n, int mi, int ma) {
    return max(mi, min(ma, n));
}

int dp[20010][256];
int solve_testcase() {
    int N, M; cin >> N >> M;
    if(N == 0 and M == 0) return 1;

    vector<int> C(M);
    for(int i=0; i<M; i++) cin >> C[i];

    vector<int> x(N);
    for(int i=0; i<N; i++) cin >> x[i];

    const int mi = 0, ma = 255;
    fill(dp[0], dp[N+1], INF);
    dp[0][128] = 0;
    for(int i=0; i<N; i++) {
        for(int j=0; j<256; j++) {
            for(int k=0; k<M; k++) {
                int nj = clamp(j + C[k], mi, ma);
                int er = (nj - x[i]) * (nj - x[i]);
                dp[i+1][nj] = min(dp[i+1][nj], dp[i][j] + er);
            }
        }
    }

    cout << *min_element(dp[N], dp[N] + 256) << endl;
    return 0;
}

int main() {
    while(!solve_testcase());
    return 0;
}