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 <algorithm>
#include <queue>
#include <tuple>
#include <limits>

using namespace std;

int main()
{
	for(int n,m;cin>>n>>m,n|m;){
		int cs[m],xs[n];
		for(int i=0;i<m;i++) cin>>cs[i];
		for(int i=0;i<n;i++) cin>>xs[i];
		
		queue<tuple<int,int,int>> q; // (index,value,sqrsum)
		q.emplace(0,128,0);
		
		int dp[n+1][256];
		for(int i=0;i<=n;i++)
			fill(dp[i],dp[i]+256,numeric_limits<int>::max());
		
		while(!q.empty()){
			auto cur=q.front(); q.pop();
			int ci=get<0>(cur),cval=get<1>(cur),csum=get<2>(cur);
			
			if(dp[ci][cval]<=csum)
				continue;
			dp[ci][cval]=csum;
			
			if(ci==n)
				continue;
			
			for(int i=0;i<m;i++){
				int nval=max(min(cval+cs[i],255),0);
				int nsum=csum+(nval-xs[ci])*(nval-xs[ci]);
				q.emplace(ci+1,nval,nsum);
			}
		}
		
		cout<<*min_element(dp[n],dp[n]+256)<<endl;
	}
	
	return 0;
}

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

unsigned int errorSum[2][256];
bool concerning[2][256];

short samples[20001];
int codeBook[16];

const unsigned int MAX = (1 << 32) - 1;

int main() {
	int n, m;
	while(true) {

		cin >> n >> m;

		if (n == 0 && m == 0) {
			break;
		}

		for (int i = 0; i < m; i++) {
			cin >> codeBook[i];
		}
		for (int i = 1; i <= n; i++) {
			cin >> samples[i];
		}

		for (int i = 0; i < 256; i++) {
			errorSum[0][i] = errorSum[1][i] = MAX;
			concerning[0][i] = concerning[1][i] = false;
		}
		concerning[0][128] = true;

		for (int i = 0; i < n; i++) {
			for (int j = 0; j < 256; j++) {
				if(concerning[i % 2][j]) {
					concerning[i % 2][j] = false;
					for (int k = 0; k < m; k++) {
						int next = min(max(0, j + codeBook[k]), 255);
						unsigned int error = (errorSum[i % 2][j] == MAX ?
								0 : errorSum[i % 2][j])
								+ (next - samples[i+1]) * (next - samples[i+1]);

						if(error <= errorSum[(i+1) % 2][next]) {
							concerning[(i+1) % 2][next] = true;
							errorSum[(i+1) % 2][next] = error;
						}
					}
				}
				errorSum[i % 2][j] = MAX;
			}
		}

		unsigned int minError = MAX;
		int lastIndex = n % 2;
		for (int i = 0; i < 256; i++) {
			if(concerning[lastIndex][i]
			        && errorSum[lastIndex][i] < minError) {
				minError = errorSum[lastIndex][i];
			}
		}
		cout << minError << endl;
	}
	return 0;
}

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

int sqr(int x) { return x*x; }

int main()
{
  int N, M;
  while (scanf("%d %d", &N, &M) != EOF && N != 0) {
    vector<int> cs(M);
    for (int i = 0; i < M; i++) {
      scanf("%d", &cs[i]);
    }

    static int dp[20000+1][256];
    static const int INF = 10000000;
    fill_n(dp[0], 256, INF);
    dp[0][128] = 0;
    for (int i = 1; i <= N; i++) {
      int x;
      scanf("%d", &x);
      fill_n(dp[i], 256, INF);
      for (int j = 0; j < 256; j++) {
        for (int k = 0; k < M; k++) {
          int y = j + cs[k];
          if (y < 0) {
            y = 0;
          } else if (y > 255) {
            y = 255;
          }
          dp[i][y] = min(dp[i][y], dp[i-1][j] + sqr(y - x));
        }
      }
    }
    printf("%d\n", *min_element(dp[N], dp[N]+256));
  }
  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 = 20001;

// 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 <= MAX_N ; i++ ){
			for(int j=0 ; j < MAX_M ; 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;

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int INF = 1000000007;

    while (1) {
        int N, M;
        cin >> N >> M;
        if (!N & !M) break;
        vector<long long> codeBook(M, 0);
        vector<long long> inputSignal(N, 0);
        for (int i = 0; i < M; i++) {
            cin >> codeBook[i];
        }
        for (int i = 0; i < N; i++) {
            cin >> inputSignal[i];
        }
        vector<vector<long long>> dp(256, vector<long long>(N + 10, INF));
        dp[128][0] = 0;
        for (int i = 0; i < N; i++) {
            for (int start = 0; start < 256; start++) {
                if (dp[start][i] == INF) continue;
                for (auto c : codeBook) {
                    int next = start + c;
                    next = next > 255 ? 255 : next;
                    next = next < 0 ? 0 : next;
                    dp[next][i + 1] =
                        min(dp[start][i] + (next - inputSignal[i]) * (next - inputSignal[i]),
                            dp[next][i + 1]);
                }
            }
        }
        long long ans = INF;
        for (int i = 0; i < 256; i++) {
            ans = min(dp[i][N], ans);
        }
        cout << ans << endl;
    }
}