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 <stdio.h>
#include <string.h>
#include <queue>

using namespace std;

int main(void){
	int n, m, i, j, c[16], x, t;
	long long int f[17][256], k;
	queue<int> que1, que2;
	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));
		que1.push(128);
		f[0][128] = 0;
		for(i = 0;i < n;i++){
			scanf("%d",&x);
			for(k = 0;k < 256;k++){ // 現在位置
				if(f[i][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][t] == -1 || f[i + 1][t] > f[i][k] + (x - t) * (x - t))
							f[i + 1][t] = f[i][k] + (x - t) * (x - t);
					}
				}
			}
		}
		k = 0x7FFFFFFF;
		for(i = 0;i < 256;i++){
			if(f[n][i] != -1)
				k = min(f[n][i],k);
		}
		printf("☆%d\n",k);
	}
	return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;

constexpr int inf = 1e9;

int main() {
    int n, m;
    while(cin >> n >> m, n) {
        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<int> dp(256, inf);
        dp[128] = 0;
        for(int i = 0; i < n; ++i) {
            vector<int> nxt(256, inf);
            for(int j = 0; j <= 255; ++j) {
                for(int k = 0; k < m; ++k) {
                    int nc = max(0, min(255, j + c[k]));
                    nxt[nc] = min(nxt[nc], dp[j] + (x[i] - nc) * (x[i] - nc));
                }
            }
            dp = move(nxt);
        }

        cout << *min_element(begin(dp), end(dp)) << endl;
    }
}

C++: #include<bits/stdc++.h>
#define _ ios_base::sync_with_stdio(0);cin.tie(0);
#define REP(i,n) for(int i=0;i<(int)(n);i++)

using namespace std;
typedef long long int ll;

const int MAX_C=16;
const int MAX_Y=256;
const int MAX_N=20000;
const ll INF=(ll)MAX_Y*MAX_Y*MAX_N;
ll c[MAX_C];
ll x[MAX_N];
ll dp[MAX_Y][MAX_N+1];
int n,m;

ll sq(ll a){return a*a;}
void solve(){
  REP(i,MAX_Y) dp[i][n]=0;
  for(int j=n-1;j>=0;j--){
    REP(i,MAX_Y){
      dp[i][j]=INF;
      REP(k,m){
	int yn1 = i+c[k]; yn1=min(max(yn1,0),MAX_Y-1);
	dp[i][j]=min(dp[i][j],dp[yn1][j+1]+sq(i-x[j]));
      }
    }
  }
  ll result=INF;
  REP(k,m){
    int yn1=128+c[k]; yn1=min(max(yn1,0),MAX_Y-1);
    result=min(result,dp[yn1][0]);
  }
  cout<<result<<endl;
}


int main(){ _;
  while(cin>>n>>m,(n|m)!=0){
    REP(i,m) cin>>c[i];
    REP(i,n) cin>>x[i];
    solve();
  }
}

C++: #include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>

using namespace std;
 
int main() {
 int n,m;
 while(cin >> n >> m, n) {
  vector<int> code(m), value(n);
  for (int i = 0; i < m; i++)
   cin >> code[i];
  for (int i = 0; i < n; i++)
   cin >> value[i];
  vector<vector<int> > dp(256, vector<int>(n + 1, 1000000000));
  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++) {
     int val = min(255,max(0,j+code[k]));
     dp[i+1][val] = min(dp[i+1][val], dp[i][j] + (val -value[i]) * (val - value[i]));
    }
   }
  }
  int ans = 1000000000;
  for (int i = 0; i < 256; i++) {
   ans = min(ans, dp[n][i]);
  }
  cout << ans << endl;
 }
 return 0;
}

C++: #include<iostream>
#include<string>
#include<algorithm>
#include<set>
#include<map>
#include<vector>
#include<stack>
#include<queue>
#include<cmath>
#include<numeric>
#include<cstdlib>
#include<cassert>
#include<random>
using namespace std;

const int e=1e9+7;

int cut(int n){
    if(n>255){n=255;}
    if(n<0){n=0;}
    return n;
}

int dp[25000][256];


int main(){
    while(1){
    
        
        
    int n,m;
    fill(&dp[0][0],&dp[24999][256],e);
    vector<int> in,c;
    cin>>n>>m;
        if(n==0 && m==0){break;}
    for(int i=0;i<m;i++){
        int d;
        cin>>d;
        c.push_back(d);
    }
    for(int i=0;i<n;i++){
        int d;
        cin>>d;
        in.push_back(d);
    }
    dp[0][128]=0;
    
    for(int i=0;i<n;i++){
        for(int t=0;t<256;t++){
            for(int h=0;h<c.size();h++){
                if(dp[i][t]!=e){
                    dp[i+1][cut(t+c[h])]=min(dp[i+1][cut(t+c[h])],dp[i][t]+(int)pow((in[i]-cut(t+c[h])),2));
                }
            }
        }
    }
    int ans=e;
    for(int i=0;i<256;i++){
        ans=min(ans,dp[n][i]);
    }
    cout<<ans<<endl;
    
        
        
    }
    return 0;
}