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>

using namespace std;

long long int ans;

void function(int y,int index,int *c,int *x,int n,int m,int now){

	//cout<<y<<" "<<index<<" "<<n<<" "<<m<<" "<<now<<endl;

	if(now>=ans){
		return;
	}
	if(index>=n){
		if(ans>=now){
			ans = now;
		}
		return;
	}
	for(int i=0;i<m;i++){
		int nextY = y+c[i];
		if(nextY>=255)nextY=255;
		else if(nextY<=0)nextY=0;
		function(nextY,index+1,c,x,n,m,now+(nextY-x[index])*(nextY-x[index]));
	}
}

int min(int a,int b){
	if(a>=b)return b;
	else return a;
}

int main(){

	int n,m;
	long long int dp[20][256];
	int next;

	while(cin>>n>>m){
		ans = 1000000000000000;
		if(n==0 && m==0){
			break;
		}
		int *c;
		int *x;
		c = new int[m];
		x = new int[n];

		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<256;j++){
				dp[i][j]=10000000000;
			}
		}

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


		cout<<ans<<endl;

	}

	return 0;

}

C++: #include<iostream>
using namespace std;
const int inf=1e8;

void hoge(int N, int M){

   int c[M];
   for(int i=0; i<M; i++) cin>> c[i];
   int x[N];
   for(int i=0; i<N; i++) cin>> x[i];
   int memo[N+1][256];
   for(int i=0; i<N+1; i++){
      for(int j=0; j<256; j++){
         memo[i][j]=inf;
      }
   }

   memo[0][128]=0;
   for(int i=0; i<N; i++){
      for(int j=0; j<256; j++){
         if(memo[i][j]==inf) continue;
         for(int k=0; k<M; k++){
            int p=max(0, min(255, j+c[k]));
            memo[i+1][p]=min(memo[i][j]+(p-x[i])*(p-x[i]), memo[i+1][p]);
         }
      }
   }
   int mi=1e8;
   for(int j=0; j<256; j++) mi=min(mi, memo[N][j]);
   cout<< mi<< endl;

}


int main(){

   while(1){
      int N, M;
      cin>> N>> M;
      if(!(N||M)) break;
      hoge(N, M);
   }
   return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n) ; i++)
#define rrep(i,n) for(int i = n-1; i >= 0 ; i--)
constexpr auto INF = 2147483647;
typedef long long ll;

  int n, m;
  int DP[20005][256], codebook[16], inp[20005];

int main(){
  while(true){
    cin >> n >> m;
    if(n==0) break;
    rep(i,m) cin >> codebook[i];
    rep(i,n) cin >> inp[i];
    rep(i,n+1)rep(j,256) DP[i][j] = INF;
    DP[0][128] = 0;
    rep(i,n)rep(j,256){
      if(DP[i][j] == INF)continue;
      rep(k,m){
        int next = j+codebook[k];
        next = min(255,max(0,next));
        int diff = (next - inp[i])*(next - inp[i]);
        DP[i+1][next] = min(DP[i+1][next],DP[i][j]+diff);
      }
    }
    int ans = INF;

    rep(i,256) ans = min(ans, DP[n][i]);
    cout << ans << endl;
  }

  return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
#define int long long 
#define pint pair<int,int>

int C[20];
int x[20100];

int dp[20100][300];

const int inf = 1LL << 60;

void calib(int &a){
  if( a < 0 ){ a = 0;}
  if( a > 255){ a = 255;}
  return;
}

void chmin(int &a, int b){ if ( a > b ){ swap(a,b);} return;}

signed main(void){
  int n,m; 
  while(cin >> n >> m){
    if( n == 0 && m == 0 ){ return 0;}
    
    for(int i = 1; i <= m; i++){ cin >> C[i];}
    for(int i = 1; i <= n; i++){ cin >> x[i];}
    
    for(int i = 0; i < 20100; i++){
      for(int j = 0; j < 300; j++){ 
        dp[i][j] = inf;
      }
    }
    
    dp[0][128] = 0;
   
    for(int i = 1; i <= n; i++){ 
      // i-1個目からi個目にかけての遷移を見る
      for(int val = 0; val <= 255; val++){ 
        if( dp[i-1][val] == inf ){ continue;}
        for(int k = 1; k <= m; k++){ //どの系列を選ぶか
         int res = val+C[k];
         calib(res);
         chmin( dp[i][res], dp[i-1][val]+(x[i]-res)*(x[i]-res) );
          
        }
      }
    }
    
    int ans = inf;
    
    for(int i = 0; i <= 255; i++){ 
      chmin(ans,dp[n][i]);
      
    }
    
    cout << ans << endl;
    
  }//while
  
  return 0;
}