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 <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using std::cerr;
using std::cin;
using std::cout;
using std::endl;

int64_t Diff(int64_t a, int64_t b) {
  // cerr << "\033[93m" << a << " " << b << "\033[m" << endl;
  return (a - b) * (a - b);
}

int64_t Solve(int64_t n, int64_t m) {
  std::vector<int> code(m);
  std::vector<int> input(n);
  for (int i = 0; i < m; i++) {
    cin >> code[i];
  }
  for (int i = 0; i < n; i++) {
    cin >> input[i];
  }

  int64_t dp[20000][256];
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < 256; j++) {
      dp[i][j] = INT64_MAX;
    }
  }
  // init
  for (auto c : code) {
    int output = 128 + c;
    if (output < 0) {
      output = 0;
    } else if (255 < output) {
      output = 255;
    }

    dp[0][output] = Diff(input[0], output);
    // cerr << "\033[93m" << c << " " << dp[0][output] << "\033[m" << endl;
  }

  for (int t = 1; t < n; t++) {
    for (int prev_l = 0; prev_l < 256; prev_l++) {
      if (dp[t - 1][prev_l] == INT64_MAX) continue;
      for (auto c : code) {
        int curr_l = prev_l + c;
        if (curr_l < 0)
          curr_l = 0;
        else if (255 < curr_l)
          curr_l = 255;
        dp[t][curr_l] =
            std::min(dp[t][curr_l], dp[t - 1][prev_l] + Diff(input[t], curr_l));
      }
    }
  }

  int64_t result = INT64_MAX;
  for (int i = 0; i < 256; i++) {
    result = std::min(result, dp[n - 1][i]);
  }
  return result;
}

int main(void) {
  cout << std::fixed << std::setprecision(10);
  cin.tie(0);
  std::ios::sync_with_stdio(false);

  while (1) {
    int n, m;
    cin >> n >> m;
    if (n == 0 && m == 0) {
      break;
    }
    cout << Solve(n, m) << endl;
  }

  return 0;
}

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

int c[16], x[20001];
int dp[20001][256];
int diff(int i, int a) {
	return (x[i] - a)*(x[i] - a);
}
int main() {
	int n, m;
	while (scanf("%d%d", &n, &m), n) {
		rep(i, m)scanf("%d", &c[i]);
		rep(i, n)scanf("%d", &x[i]);
		memset(dp, 0x3f, sizeof(dp));
		dp[0][128] = 0;
		rep(i, n)rep(j, 256) {
			if (dp[i][j] == INF)continue;
			rep(k, m) {
				int a = min(255, max(0, j + c[k]));
				dp[i + 1][a] = min(dp[i + 1][a], dp[i][j] + diff(i, a));
			}
		}
		int Min = INF;
		rep(j, 256)Min = min(Min, dp[n][j]);
		printf("%d\n", Min);
	}
}

C++: #include <iostream>
#include <algorithm>

using namespace std;

const int MAX_N = 20000;
const int MAX_M = 16;
const int INF = 1 << 29;

int C[MAX_M];
int X[MAX_N];
int dp[2][256];

int sub_pow ( int a, int b )
{
	int c = a - b;
	return c * c;
}

int main ( void )
{
	int n, m;
	while (cin >> n >> m, n|m) {
		for (int i = 0; i < 2; ++i) {
			fill(dp[i], dp[i]+256, INF);
		}
		for (int i = 0; i < m; ++i) {
			cin >> C[i];
		}
		for (int i = 0; i < n; ++i) {
			cin >> X[i];
		}
		dp[0][128] = 0;
		for (int i = 0; i < n; ++i) {
			int a = i & 1, b = (i + 1) & 1;
			fill(dp[b], dp[b]+256, INF);
			for (int j = 0; j < 256; ++j) {
				if (dp[a][j] == INF) { continue; }
				for (int k = 0; k < m; ++k) {
					int x = min(max(0, j + C[k]), 255);
					dp[b][x] = min(dp[b][x], dp[a][j] + sub_pow(x, X[i]));
				}
			}
		}
		int ans = INF;
		for (int i = 0; i < 256; ++i) {
			ans = min(ans, dp[n & 1][i]);
		}
		cout << ans << endl;
	}
	return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
const int INF = 1 << 30;

int main(){
  int N, M, C[16], x[20000];
  int dp[2][256];
  
  while(scanf("%d %d", &N, &M), N){
    for(int i = 0; i < M; i++){
      scanf("%d", &C[i]);
    }
    for(int i = 0; i < N; i++){
      scanf("%d", &x[i]);
    }
    fill_n( *dp, 2 * 256, INF);
    dp[0][128] = 0;
    for(int i = 0; i < N; i++){
      for(int j = 0; j < 256; j++){
        if(dp[i & 1][j] == INF) continue;
        for(int k = 0; k < M; k++){
          int value = min( 255, max( 0, j + C[k]));
          dp[(i + 1) & 1][value] = min( dp[(i + 1) & 1][value], dp[i & 1][j] + (x[i] - value) * (x[i] - value));
        }
      }
      for(int j = 0; j < 256; j++) dp[i & 1][j] = INF;
    }
    int ret = INF;
    for(int i = 0; i < 256; i++){
      ret = min( ret, dp[N & 1][i]);
    }
    cout << ret << endl;
  }
}

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

int main(){
    int n, m;
    while(cin >> n >> m, n+m){
        vector<vector<int>> dp(256, vector<int>(n+1, 1<<30));
        dp[128][0] = 0;
        vector<int> c(m);
        for(int i = 0; i < m; i++)  cin >> c[i];
        for(int i = 0; i < n; i++){
            int x;  cin >> x;
            for(int j = 0; j < 256; j++){
                for(int k = 0; k < m; k++){
                    int next = j + c[k];
                    if(next < 0)    next = 0;
                    if(next > 255)  next = 255;
                    dp[next][i+1] = min(dp[next][i+1], dp[j][i]+(next-x)*(next-x));
                }
            }
        }
        int ans = 1<<30;
        for(int j = 0; j < 256; j++)    ans = min(ans, dp[j][n]);
        cout << ans << endl;
    }
    return 0;
}