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>
#define ALL(a)  (a).begin(),(a).end()
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<long long, long long> Pll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<long long> vll;
typedef vector<vector<long long>> vvll;
template <typename T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template <typename T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const long long INF = 1LL << 60;
const int INT_INF = 1LL << 30;

int main(){
while(true){
  int N, M;
  cin >> N >> M;
  if(N==0 && M == 0) break;
  vi C(M), x(N+1);
  for(int i = 0; i < M; i++){
    cin >> C.at(i);
  }
  for(int i = 1; i <= N; i++){
    cin >> x.at(i);
  }

  vvi dp(N+1, vi(256, INT_INF));
  dp.at(0).at(128) = 0;
  for(int i = 0; i < N; i++){
    for(int j = 0; j < 256; j++){
      if(dp.at(i).at(j) == INF) continue;
      for(int k = 0; k < M; k++){
        int nextj = j+C.at(k);
        if(nextj < 0) nextj = 0;
        if(nextj > 255) nextj = 255;
        chmin(dp.at(i+1).at(nextj), dp.at(i).at(j) + (nextj-x.at(i+1))*(nextj-x.at(i+1)));
      }
    }
  }
  int result = INT_INF;
  for(int i = 0; i < 256; i++){
    chmin(result, dp.at(N).at(i));
  }
  cout << result << endl;
}
}

C++: #include <iostream>
#include <algorithm>
using namespace std;
#define MAX 100000000;

int i,j,k,n,m,c[17],N[20001],dp[256][20001],x;

int main(){
  
  while(1){
    cin >> n >> m;
    if( n == 0 && m ==  0 ) break;
  
    for( i = 0; i < m; i++ ) cin >> c[i];
    for( i = 0; i < n; i++ ) cin >> N[i];
    
    for( i = 0; i < 256; i++ ){
      for( j = 0; j <= n; j++ ){
	dp[i][j] = MAX;
      }
    }
    
    dp[128][0] = 0;
    //  int data[20000];
      for( j = 0; j < n; j++ ){
    for( i = 0; i <= 255; i++ ){
	//	int Min = 100000;
	for( k = 0; k < m; k++ ){
	  x = ( i + c[k] );
	  if( x < 0 ) x = 0;
	  if( x > 255 ) x = 255;
	  //dp[x][0] = 0;
	  dp[x][j+1] = min( dp[x][j+1], dp[i][j] + (x - N[j]) *( x - N[j] ) );

	  /*  if( Min > ( x - N[j] ) * ( x - N[j] ) ){
	    Min = ( x - N[j] ) * ( x - N[j] );
	    cout << "Min" << " " << Min << endl;
	    data[j] = x;
	  }
	  */
	}
      }
    }
    
      /* for( i = 0; i < 256; i++ ){
      cout << "i" << " " << i << " ";
      for( j = 0; j <= n; j++ ){
	cout <<  dp[i][j] << " ";
      }
      cout << endl;
      }*/
    int Min = 1000000;

     for( i = 0; i < 256; i++ ){
       if ( Min > dp[i][n] ){
	 Min = dp[i][n];
	 }
     }
     cout << Min << endl;
  }
  
  return 0;
}

C++: #include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> VI;
typedef vector<VI> VVI;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const int INF = numeric_limits<int>::max() / 2;
const int NEG_INF = numeric_limits<int>::min() / 2;

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

  while(true){
      int n,m;cin>>n>>m;
      if(n==0 && m==0) break;
      std::vector<int> c(m),x(n+1);
      for(int i=0;i<m;i++) cin>>c[i];
      for(int i=1;i<=n;i++) cin>>x[i];
      ll dp[n+1][256];
      for(int i=0;i<n+1;i++)for(int j=0;j<256;j++)dp[i][j]=INF;
      dp[0][128]=0;
      for(int i=0;i<n;i++)for(int j=0;j<256;j++){
          for(int k=0;k<m;k++){
              if(j+c[k]>255) dp[i+1][255]=min(dp[i+1][255],dp[i][j]+(255-x[i+1])*(255-x[i+1]));
              else if(j+c[k]<0) dp[i+1][0]=min(dp[i+1][0],dp[i][j]+(x[i+1])*(x[i+1]));
              else dp[i+1][j+c[k]]=min(dp[i+1][j+c[k]],dp[i][j]+(j+c[k]-x[i+1])*(j+c[k]-x[i+1]));
          }
      }
      ll res=INF;
      for(int i=0;i<256;i++) res=min(res,dp[n][i]);
      cout<<res<<endl;
  }
  return 0;
}

C++: // AOJ2199
#include <bits/stdc++.h>
#define endl "\n"
#define rep(i,n) for(int i=0;i<int(n);i++)
#define SZ(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> ipair;
typedef pair<ll,ll> lpair;
template <class T>ostream &operator<<(ostream &o,const vector<T>&v) //vectorの中身を見る
{o<<"{";for(int i=0;i<(int)v.size();i++)o<<(i>0?", ":"")<<v[i];o<<"}";return o;}

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

    int n,m;
    while(cin>>n>>m){
        if(n==0&&m==0) break;
        vector<int> code(m+1,0);
        vector<ll> num(n+1,0);
        rep(i,m) cin>>code[i+1];
        rep(i,n) cin>>num[i+1];
        ll max_=pow(10,12);
        vector<vector<ll>> dp(n+5,vector<ll>(260,max_));
        for(int i=1;i<=m;i++){
            int cy=min(255,128+code[i]);
            cy=max(0,cy);
            dp[1][cy]=(num[1]-cy)*(num[1]-cy);
        }
        for(int i=1;i<=n-1;i++){
            for(int j=0;j<=255;j++){ //遷移前のyの値
                if(dp[i][j]==max_) continue;
                for(int k=1;k<=m;k++){ // 遷移する際のコード番号
                    int ny=min(255,j+code[k]);
                    ny=max(0,ny);
                    dp[i+1][ny]=min(dp[i][j]+(num[i+1]-ny)*(num[i+1]-ny),dp[i+1][ny]);
                }
            }
        }
        ll ans=max_;
        for(int i=0;i<=255;i++) ans=min(ans,dp[n][i]);
        cout<<ans<<endl;
    }
    return 0;
}