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 <bits/stdc++.h>
using namespace std;

const int inf = 1000000000;

int main() {
	int n, m;
	while (cin >> n >> m, n) {
		int c[16], x[20000];
		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++) {
				if (dp[i][j] != inf) {
					for (int k = 0; k < m; k++) {
						int j2 = max(0, min(255, j + c[k]));
						dp[i + 1][j2] = min(dp[i + 1][j2], dp[i][j] + (x[i] - j2) * (x[i] - j2));
					}
				}
			}
		}
		int r = inf;
		for (int i = 0; i < 256; i++) {
			r = min(r, dp[n][i]);
		}
		cout << r << endl;
	}
	return 0;
}

C++: #include <iostream>
#include <climits>
using namespace std;
pair <long long,int> dp[16][20001];
int c[16];
int x[20000];


int main (){
  int n,m;
  while(cin>>n>>m &&(n||m)){
    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<m;i++)
      for(int j=0;j<=n;j++) dp[i][j] = make_pair(LONG_MAX,255);
      
    for(int i=0;i<m;i++) dp[i][0] = make_pair(0,128);

    for(int i=0;i<n;i++){
      for(int j=0;j<m;j++){
	for(int k=0;k<m;k++){
	  long long u=dp[j][i].second+c[k];
	  if(u<0) u=0;
	  if(u>255) u=255;
	  dp[k][i+1]=min(dp[k][i+1],make_pair(dp[j][i].first+(x[i]-u)*(x[i]-u),(int)u));
	}
      }
    }
    long long res=LONG_MAX;
    for(int i=0;i<m;i++) res = min(dp[i][n].first,res);
    cout<<res<<endl;
  }

    

  return 0;
}

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

int c[16];
int x[20001];
int dp[256][20001];

int main() {
	int n, m;
	while (std::cin >> n >> m && (n || m)) {
		std::memset(dp, 0xff, sizeof(dp));
		for (int i = 0; i < m; i++) std::cin >> c[i];
		for (int i = 0; i < n; i++) std::cin >> x[i + 1];

		dp[128][0] = 0;
		for (int i = 1; i <= n; i++) { //????????????????????????
			for (int j = 0; j < 256; j++) { //?????????0~255??¨???????????????
				if (dp[j][i - 1] < 0) continue; //??????????????????
				for (int k = 0; k < m; k++) { //??¨?????????????????????????????????????????????
					int ny = j + c[k];
					if (ny < 0) ny = 0;
					else if (ny > 255) ny = 255;

					int v = (x[i] - ny) * (x[i] - ny);
					if (dp[ny][i] < 0) dp[ny][i] = dp[j][i - 1] + v;
					else {
						dp[ny][i] = std::min(dp[j][i - 1] + v, dp[ny][i]);
					}
				}
			}
		}
		int min = INT_MAX;
		for (int i = 0; i < 256; i++) if (dp[i][n] >= 0) min = std::min(dp[i][n], min);
		std::cout << min << std::endl;
	}

	return 0;
}

C++: #include <iostream>
#include <cstring>
#include <climits>

using namespace std;

int N, M;
int C[20];
int X[20020];

int INF = 1300500001;
int dp[20020][300];

void solve() {
	for (int i=0; i<20020; i++) fill(dp[i], dp[i]+300, INF);
	
	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++) {
				int jck = j+C[k];
				if (jck < 0) jck = 0;
				if (jck > 255) jck = 255;
				if (dp[i][j] == INF) continue;
				dp[i+1][jck] = min(dp[i+1][jck], dp[i][j] + (jck-X[i])*(jck-X[i]) );
			}
			
		}
	}
	
	int ans = INF;
	for (int i=0; i<=255; i++) ans = min(ans, dp[N][i]);
	cout << ans << endl;	
}

int main() {

	while(1) {
		cin >> N >> M; if (N==0 && M==0) break;
		for (int i=0; i<M; i++) cin >> C[i];
		for (int i=0; i<N; i++) cin >> X[i];
		
		solve();
	}
	
	return 0;
}

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

int main(){
  int i,j,k,n,m;
  while(cin >> n >> m && n && m){
    vector<int> C,x;
    for(i=0;i<m;i++){
      int a;
      cin >> a;
      C.push_back(a);
    }
    for(i=0;i<n;i++){
      int a;
      cin >> a;
      x.push_back(a);
    }

    unsigned long long y[256][2];
    bool f[256][2];
    for(i=0;i<256;i++){
      y[i][0] = y[i][1] = 0;
      f[i][0] = f[i][1] = false;
    }
    f[128][0] = true;

    for(i=0;i<n;i++){
      for(j=0;j<m;j++){
	for(k=0;k<256;k++){
	  if(f[k][0]){
	    int a = k + C[j];
	    if(a < 0) a = 0;
	    else if(a > 255) a = 255;

	    if(y[k][0] >= (unsigned long long)(2*pow(2.0,63))-1) continue;

	    if(!f[a][1]) y[a][1] = y[k][0]+(x[i]-a)*(x[i]-a);
	    else y[a][1] = min(y[a][1],y[k][0]+(x[i]-a)*(x[i]-a));
	    f[a][1] = true;
	  }
	}
      }
      for(j=0;j<256;j++){
	y[j][0] = y[j][1];
	y[j][1] = 0;
	f[j][0] = f[j][1];
	f[j][1] = false;
      }
    }

    unsigned long long ans = 0;
    bool f2 = false;
    for(i=0;i<256;i++){
      if(f[i][0]){
	if(!f2){
	  ans = y[i][0];
	  f2 = true;
	}
	else ans = min(ans,y[i][0]);
      }
    }
    cout << ans << endl;
  }
  return 0;
}