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>
#include <set>
#include <vector>
#include <algorithm>
using namespace std;
const int INF = 1 << 22;
const int MAX_N = 21000;
const int MAX_M = 20;
int table[MAX_N+1][256];
int x[MAX_N];
int book[MAX_M];
void db_print(int line[]){
  for(int i = 100; i < 200; ++i){
    cout << i << "[" << line[i] << "]" << endl;
  }
  cout << endl;
}
int main(){
  int N, M;
  while(true){
    cin >> N >> M;
    if((N|M) == 0){
      break;
    }
    for(int i = 0; i < M; ++i){
      cin >> book[i];
    }
    for(int i = 0; i < N; ++i){
      cin >> x[i];
    }
    for(int i = 0; i < N+1; ++i){
      for(int j = 0; j < 256; ++j){
	table[i][j] = INF;
      }
    }
    //fill_n((int *) table, (N+1) * 256, INF);
    table[0][128] = 0;
    for(int i = 0; i < N; ++i){
      //db_print(table[i]);
      for(int j = 0; j < 256; ++j){
	for(int b = 0; b < M; ++b){	  
	  int d = book[b];
	  if(0 <= j+d && j+d <= 255){
	    int t = (x[i] - (j+d)) * (x[i] - (j+d));
	    table[i+1][j+d] = min(table[i+1][j+d], table[i][j]+t);
	  }
	  if(j+d < 0){
	    int t = (x[i] - 0) * (x[i] - 0);
	    table[i+1][0] = min(table[i+1][0], table[i][j]+t);
	  }
	  if(j+d > 255){
	    int t = (x[i] - 255) * (x[i] - 255);
	    table[i+1][255] = min(table[i+1][255], table[i][j]+t);
	  }
	}
      }
    }
    //db_print(table[N]);
    int ans = INF;
    for(int i = 0; i < 256; ++i){
      ans = min(ans, table[N][i]);
    }
    cout << ans << endl;
  }    
  return 0;
}

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

using ll = long long;

int main() {
    // dp[i][j] y_i=jであるときの二乗和の最小値
    int N, M;
    cin >> N >> M;
    while (N != 0) {
        vector<int> C(M), x(N);
        rep(i, M) cin >> C[i];
        rep(i, N) cin >> x[i];
        vector<vector<int>> dp(N + 1, vector<int>(256, 1e9));
        dp[0][128] = 0;
        rep(i, N) {
            rep(j, 256) {
                rep(k, M) {
                    int y = j + C[k];
                    if (y < 0) y = 0;
                    if (y > 255) y = 255;
                    dp[i + 1][y] = min(dp[i + 1][y], dp[i][j] + (x[i] - y) * (x[i] - y));
                    /*
                    if (dp[i + 1][y] < 1e9) {
                        cout << "dp[" << i + 1 << "][" << y << "]=" << dp[i + 1][y] << "\n";
                    }
                    */
                }
            }
        }
        int ans = 1e9;
        rep(j, 256) {
            ans = min(ans, dp[N][j]);
        }
        cout << ans << "\n";
        cin >> N >> M;
    }
}

C++: #include<iostream>
#include<math.h>
#include<algorithm>
using namespace std ;
#define INF 1300500100

int table[520][20010] ;

main()
{
	int n , m ;
	int c[20] , p[20010] ;
	
	while( cin >> n >> m , n  )
	{
		for( int i=0 ; i<m ; i++ ) cin >> c[i] ;
		for( int i=1 ; i<=n ; i++ ) cin >> p[i] ;
		
		for( int i=0 ; i<520 ; i++ )
			for( int j=0 ; j<20010 ; j++ )
				table[i][j] = INF ;
		
		table[255+128][0] = 0 ;
		
		for( int i=1 ; i<=n ; i++ )
		{
			for( int j=0 ; j<=510 ; j++ )
			{
				if( table[j][i-1] != INF )
				{
					for( int k=0 ; k<m ; k++ ){
						int y = j-255+c[k] ;
						if( y > 255 ) y = 255 ;
						else if( y < 0 ) y = 0 ;
						
						table[y+255][i] = min( table[y+255][i] , table[j][i-1]+(p[i]-y)*(p[i]-y) ) ;
					}
				}
			}
		}
		
		int ans = INF ;
		for( int i=0 ; i<=510 ; i++ ) ans = min( ans , table[i][n] ) ;
		cout << ans << endl ;
	}
}

C++: #include <stdio.h>
#include <string.h>
#define min(a,b) a > b ? b : a

int main(void){
	int n, m, i, j, c[16], x, t;
	long long int f[2][256], k;
	while(1){
		scanf("%d%d",&n,&m);
		if(n == 0 && m == 0)
			break;
		for(i = 0;i < m;i++)
			scanf("%d",&c[i]);
		memset(f,-1,sizeof(f));
		f[0][128] = 0;
		for(i = 0;i < n;i++){
			scanf("%d",&x);
			for(k = 0;k < 256;k++){ // 現在位置
				if(f[i % 2][k] != -1){
					for(j = 0;j < m;j++){
						t = k + c[j];
						if(t < 0)
							t = 0;
						else if(t > 255)
							t = 255;
						if(f[(i + 1) % 2][t] == -1 || f[(i + 1) % 2][t] > f[i % 2][k] + (x - t) * (x - t))
							f[(i + 1) % 2][t] = f[i % 2][k] + (x - t) * (x - t);
					}
				}
			}
			for(j = 0;j < 256;j++)
				f[i % 2][j] = -1;
		}
		k = 0x7FFFFFFF;
		for(i = 0;i < 256;i++){
			if(f[n % 2][i] != -1)
				k = min(f[n % 2][i],k);
		}
		printf("☆%d\n",k);
	}
	return 0;
}