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 <iostream>
#include <cmath>
#include <ctype.h>
#include <string> 
#include <cstring>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <map>
#include <queue>
#include <utility>
#include <vector>
#include <set>
#include <iomanip>
#include <stack>
  
using namespace std;

#define pi 3.141592653589793

int main()
{
	int n, m;
	while(1){
		cin >> n >> m;
		if(n == 0 && m == 0) break;
		int result[256][20001];
		for(int i = 0; i < 256; i++){
			for(int j = 0; j < 20001; j++){
				result[i][j] = 10000000;
			}
		}
		result[128][0] = 1;
		int c[17], x[20001];
		for(int i = 1; i < m + 1; i++){
			cin >> c[i];
		}
		for(int i = 1; i < n + 1; i++){
			cin >> x[i];
		}
		for(int i = 1; i < n + 1; i++){
			for(int j = 0; j < 256; j++){
				int nexty = j + c[i];
				if(nexty < 0) nexty = 0;
				else if(nexty > 255) nexty = 255;
				result[i][nexty] = min(result[i][nexty], result[i - 1][j] + (x[i] - nexty) * (x[i] - nexty));
			}
		}
		int ans = 1000000;
		for(int i = 1; i < 256; i++) ans = min(ans, result[i][n]);
		cout << ans << endl;
	}
	return 0;
}

C++: #include <algorithm>
#include <iostream>
#define N 20000
#define M 256
#define INF (1e9)
using namespace std;
int n,m,c[N],x[N],d[N][M],ny,t,ans;

int main(){
  while(1){
    cin>>n>>m;
    if(!n&&!m) break;
    for(int i=0;i<m;i++) cin>>c[i];
    for(int i=0;i<n;i++) cin>>x[i];
    for(int i=0;i<n;i++)
      for(int j=0;j<M;j++) d[i][j]=INF;
    for(int i=0;i<m;i++){
      ny=128+c[i];
      if(ny>255) ny=255;
      if(ny<0) ny=0;
      int t=x[0]-ny;
      d[0][ny]=t*t;
    }
    for(int i=0;i<n-1;i++)
      for(int j=0;j<M;j++){
	if(d[i][j]==INF) continue;
	for(int k=0;k<m;k++){
	  ny=j+c[k];
	  if(ny>255) ny=255;
	  if(ny<0) ny=0;
	  t=x[i+1]-ny;
	  d[i+1][ny]=min(d[i+1][ny],d[i][j]+t*t);
	}
      }
    ans=INF;
    for(int i=0;i<M;i++) ans=min(ans,d[n-1][i]);
    cout<<ans<<endl;
  }
  return 0;
}

C++: #include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <fstream>
#include <functional>
#include <bitset>
#define chmin(a, b) ((a)=min((a), (b)))
#define chmax(a, b) ((a)=max((a), (b)))
#define fs first
#define sc second
#define eb emplace_back
using namespace std;

typedef long long ll;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;

const ll MOD=1e9+7;
const ll INF=1e18;
const double pi=acos(-1);
const double eps=1e-10;

int dx[]={1, 0, -1, 0};
int dy[]={0, -1, 0, 1};

int main(){
    while(1){
        int n, m; cin>>n>>m;
        if(n == 0) return 0;
        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+10, vector<int>(300, 1e9));
        dp[0][128] = 0;

        for(int i=0; i<n; i++){
            for(int j=0; j<=255; j++){
                for(int k=0; k<m; k++){
                    if(256 <= j + c[k]){
                        dp[i+1][255] = min(dp[i+1][255], dp[i][j] + (x[i] - 255) * (x[i] - 255));
                    }
                    else if(j + c[k] < 0){
                        dp[i+1][0] = min(dp[i+1][0], dp[i][j] + x[i] * x[i]);
                    }
                    else{
                        dp[i+1][j+c[k]] = min(dp[i+1][j+c[k]], dp[i][j] + (x[i] - (j + c[k])) * (x[i] - (j + c[k])));
                    }
                }
            }
        }

        int ans=1e9;
        for(int i=0; i<=255; i++){
            chmin(ans, dp[n][i]);
        }

        cout << ans << endl;
    }
}

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

int input(int num)
{
  if (num < 0)
  {
    return 0;
  }
  if (num > 255)
  {
    return 255;
  }
  else
  {
    return num;
  }
}

int main()
{
  while (1)
  {
    int N, M;
    cin >> N >> M;
    if (N == 0 && M == 0)
    {
      break;
    }
    vector<int> C(M), X(N);
    for (int j = 0; j < M; j++)
    {
      cin >> C.at(j);
    }
    for (int i = 0; i < N; i++)
    {
      cin >> X.at(i);
    }
    vector<vector<int>> dp(N, vector<int>(256, INF));
    for (int j = 0; j < M; j++)
    {
      dp.at(0).at(input(128 + C.at(j))) = (int)pow(input(128 + C.at(j)) - X.at(0), 2);
    }
    for (int i = 1; i < N; i++)
    {
      for (int y = 0; y < 256; y++)
      {
        for (int j = 0; j < M; j++)
        {
          dp.at(i).at(input(y + C.at(j))) = min(dp.at(i).at(input(y + C.at(j))), dp.at(i - 1).at(y) + (int)pow(input(y + C.at(j)) - X.at(i), 2));
        }
      }
    }
    int ans = INF;
    for (int y = 0; y < 256; y++)
    {
      ans = min(ans, dp.at(N - 1).at(y));
    }
    cout << ans << endl;
  }
}