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<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 20000;
const int MAX_M = 16;
const int MAX_C = 256;

const int INF = 1 << 30;

/* typedef */

/* global variables */

int n, m;
int cs[MAX_M], xs[MAX_N];
int dp[2][MAX_C];

/* subroutines */

inline int diff2(int d) { return d * d; }

/* main */

int main() {
  for (;;) {
    cin >> n >> m;
    if (n == 0) break;

    for (int i = 0; i < m; i++) cin >> cs[i];
    for (int i = 0; i < n; i++) cin >> xs[i];

    int cur = 0, nxt = 1;
    for (int c = 0; c < MAX_C; c++) dp[cur][c] = INF;
    dp[cur][128] = 0;

    for (int i = 0; i < n; i++) {
      for (int c = 0; c < MAX_C; c++) dp[nxt][c] = INF;

      for (int c = 0; c < MAX_C; c++) {
	if (dp[cur][c] < INF)
	  for (int j = 0; j < m; j++) {
	    int nc = c + cs[j];
	    if (nc < 0) nc = 0;
	    else if (nc >= MAX_C) nc = MAX_C - 1;
	    int d2 = diff2(xs[i] - nc);
	    int ndp = dp[cur][c] + d2;
	    if (dp[nxt][nc] > ndp) dp[nxt][nc] = ndp;
	  }
      }

      cur ^= 1;
      nxt ^= 1;
    }

    int min_d = INF;
    for (int c = 0; c < MAX_C; c++)
      if (min_d > dp[cur][c]) min_d = dp[cur][c];
    cout << min_d << endl;
  }

  return 0;
}

C++: #include "bits/stdc++.h"

using namespace std;

using i64 = long long;

const i64 MOD = 1e9 + 7;
const i64 INF = i64(1e18) + 7;


template <typename T>
bool chmin(T& x, T y){
    if(x > y){
        x = y;
        return true;
    }
    return false;
}

template <typename T>
bool chmax(T& x, T y){
    if(x < y){
        x = y;
        return true;
    }
    return false;
}


bool solve(){
    int n, m;
    cin >> n >> m;
    if(!n)
        return false;
    vector<int> c(m);
    vector<int> x(n);
    for(int i = 0; i < m; ++i)
        cin >> c[i];
    for(int i = 0; i < n; ++i)
        cin >> x[i];

    vector<i64> dp(256, INF);
    dp[128] = 0;
    for(int i = 0; i < n; ++i){
        vector<i64> nex(256, INF);
        for(int j = 0; j < 256; ++j){
            for(auto p : c){
                int k = min(max(0, j + p), 255);
                chmin(nex[k], dp[j] + (x[i] - k) * (x[i] - k));
            }

        }
        dp = move(nex);
    }
    cout << *min_element(dp.begin(), dp.end()) << endl;
    return true;
}

signed main(){
    while(solve());
}

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

int main()
{
  int N,M,C[16],x[20001],y;
  pair<long long,int> P[20001][16];
  long long mi;
  while(1){
    cin>>N>>M;
    if(N==0 && M==0)break;
    for(int i=0;i<M;i++)cin>>C[i];
    for(int i=1;i<=N;i++)cin>>x[i];
    for(int i=0;i<M;i++){
      P[0][i].first=0;
      P[0][i].second=128;
    }
    for(int i=1;i<=N;i++){
      for(int j=0;j<M;j++){
        P[i][j].first=100000000;
        P[i][j].second=0;
      }
    }
    for(int i=1;i<=N;i++){
      for(int j=0;j<M;j++){
	for(int k=0;k<M;k++){
	  y=(P[i-1][k].second+C[j]);
          if(y<0)y=0;
	  if(y>255)y=255;
	  if(P[i][j].first>P[i-1][k].first+(x[i]-y)*(x[i]-y)){
	    P[i][j].first=P[i-1][k].first+(x[i]-y)*(x[i]-y);
            P[i][j].second=y;
	  }
	}
      }
    }
    mi=100000000;
    for(int i=0;i<M;i++)mi=min(mi,P[N][i].first);
    cout<<mi<<endl;
  }
  return 0;
}