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 <iostream>
#include <vector>
#include <algorithm>
using namespace std;

constexpr int INF = 1e9;

int main() {
    int N, M;
    while(cin >> N >> M, N) {
        vector<int> C(M), x(N);
        for(int i=0; i<M; ++i) {
            cin >> C[i];
        }
        for(int i=0; i<N; ++i) {
            cin >> x[i];
        }
        vector<vector<int>> dp(N+1, vector<int>(256, 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 next = min(255, max(0, j+C[k]));
                    dp[i+1][next] = min(dp[i+1][next], dp[i][j] + (x[i] - next) * (x[i] - next));
                }
            }
        }
        cout << *min_element(dp[N].begin(), dp[N].end()) << endl;
    }
}

C++: #include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <algorithm>
#include <utility>
#include <functional>
#include <sstream>
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <climits>
using namespace std;
inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v;}
template<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str();}
typedef vector<int> vi;
typedef vector<vi>  vvi;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef long long ll;
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define EACH(t,i,c) for(t::iretator i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define FOR(i,a,b) for(int i=(a);i<=(b);++i)
#define REP(i,n) FOR(i,0,(n)-1)
const double EPS = 1e-12;
const double PI = acos(-1.0);

const int INF = INT_MAX/10;

int main() {
	int N, M;
	while(cin >> N >> M, N) {
		vi C(M);
		REP(i, M) {
			cin >> C[i];
		}

		vvi dp(N+1, vi(256, INF));
		dp[0][128] = 0;
		int x;
		FOR(i, 1, N) {
			cin >> x;
			REP(j, 256) {
				REP(k, M) {
					int nx = j + C[k];
					nx = min(nx, 255);
					nx = max(0, nx);
					dp[i][nx] = min(dp[i][nx], dp[i-1][j] + (nx-x)*(nx-x));
				}
			}
		}

		int ans = INF;
		REP(i, 256) {
			ans = min(ans, dp[N][i]);
		}

		cout << ans << endl;
	}

	return 0;
}

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

const int INF = 1e+8;
const int MAX_M = 16;
const int MAX_N = 20000;

// dp[i][y] := i 番目までの差分の総和
int dp[MAX_N][256];

int main(){
	int N, M;
	while( cin >> N >> M, N || M ){
		int C[MAX_M] = {0};
		
		for(int i=0 ; i < M ; i++ ){
			cin >> C[i];
		}
		
		// 初期化
		for(int i=0 ; i <= N ; i++ ){
			for(int j=0 ; j < 256 ; j++ ){
				dp[i][j] = INF;
			}
		}
		dp[0][128] = 0;
		
		for(int i=1 ; i <= N ; i++ ){
			int x;
			cin >> x;
			for(int prev=0 ; prev < 256 ; prev++ ){
				for(int m=0 ; m < M ; m++ ){
					int next = prev + C[m];
					if( next < 0 ) next = 0;
					if( next > 255 ) next = 255;
					int diff = (next - x) * (next - x);
					dp[i][next] = min( dp[i][next] , dp[i-1][prev] + diff );
				}
			}
		}
		int ans = INF;
		for(int i=0 ; i < 256 ; i++ ){
			ans = min( ans , dp[N][i] );
		}
		cout << ans << endl;
	}
}

C++: #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define P pair<int,int>
#define int long long

const int INF = 1e9;
const int N = 20020;
const int M = 260;
const int S = 128;
int dp[N][M];

signed main() {
    while(true) {
        int n, m;
        cin >> n >> m;
        if (n == 0 && m == 0) {
            break;
        }

        rep(i,N) rep(j,M) dp[i][j] = INF;
        vector<int> code(m);
        vector<int> a(n);
        rep(i, m) cin >> code[i];
        rep(i, n) cin >> a[i];

        for(int i = 0; i < m; i++){
            int x = code[i] + S;
            if(x >= 255) x = 255;
            if(x <= 0) x = 0;
            dp[0][x] = (x - a[0]) * (x - a[0]);
        }

        for(int i = 1; i < n; i++){
            for(int j = 0; j < M; j++){
                for(int k = 0; k < m; k++){
                    int x = j + code[k];
                    if(x >= 255) x = 255;
                    if(x <= 0) x = 0;
                    int sq = (x - a[i]) * (x - a[i]);
                    dp[i][x] = min(dp[i][x], dp[i-1][j] + sq);
                }
            }
        }

        int ans = INF;
        for(int i = 0; i < M; i++) ans = min(ans,dp[n-1][i]);
        cout << ans << endl;
    }
}

C++: #include<iostream>
#include<vector>
#include<algorithm>
#define INF 10000000
using namespace std;
int main(){
	int n,m,x,cb[20];//now,now
	int temp;
	while(cin>>n>>m,n||m){
		vector<int> input;
		vector<int> dp[256];
		for(int i=0;i<m;i++){
			cin>>cb[i];
		}
		for(int i=0;i<n;i++){
			cin>>x;
			input.push_back(x);
		}
		for(int i=0;i<=n;i++)
		for(int j=0;j<=255;j++)
		dp[j].push_back(INF);
		dp[128][0]=0;
		for(int i=0;i<n;i++)
		for(int j=0;j<=255;j++){
			
				if(dp[j][i]!=INF){
					for(int k=0;k<m;k++){
						temp=j+cb[k];
						if(temp>255)
						temp=255;
						else if(temp<0)
						temp=0;
						dp[temp][i+1]=min(dp[temp][i+1],dp[j][i]+(temp-input[i])*(temp-input[i]));
					}
				}
		}
		int ans=INF;
		for(int i=0;i<=255;i++){
		if(ans>dp[i][n])
		ans=dp[i][n];
		}
		cout<<ans<<endl;
	}
	return 0;
}