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 <fstream>
#include <algorithm>
#include <cassert>
#include <cctype>
#include <complex>
#include <cstdio>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;

#define INF 2e9
#define rep(i,n) for(int i=0;i<n;i++)

int N,M,c[16],dp[256];

int main(){
	while(cin>>N>>M&&N){
		fill(dp,dp+256,INF);
		dp[128]=0;
		rep(i,M)cin>>c[i];
		rep(i,N){
			int m,dp2[256];
			fill(dp2,dp2+256,INF);
			cin>>m;
			rep(j,256)rep(k,M){
				int n=j+c[k];
				if(n<0)n=0;
				if(n>255)n=255;
				dp2[n]=min(dp2[n],dp[j]+(m-n)*(m-n));
			}
			rep(j,256)dp[j]=dp2[j];
		}
		int ans=INF;
		rep(i,256)ans=min(ans,dp[i]);
		cout<<ans<<endl;
	}
}

C++: #include<string>
#include <vector>
#include <stack>
#include <map>
#include<iostream>
#include <algorithm>
#include <limits.h> 
#include <functional>

using namespace std;
int n;
int m;
int price;
int a;
int b;

struct G{
	string name;
	double value;
};
bool operator>(const G& left, const G& right)
{
	if(left.value>right.value){
		return true;
	}else if(left.value<right.value){
		return false; 
	}else{
		return left.name<right.name;
	}
}

bool operator<(const G& left, const G& right)
{
	if(left.value>right.value){
		return false;
	}else if(left.value<right.value){
		return true; 
	}else{
		return left.name>right.name;
	}
}



int main(){
	while(true){
		cin >>n;
		if(n==0){
			break;
		}
		cin >>m;
		if(m==0){
			break;
		}
		vector<int> codebook;
		vector<int> data;
		for(int i=0;i<m;i++){
			cin >> a;
			codebook.push_back(a);
		}
		for(int i=0;i<n;i++){
			cin >> a;
			data.push_back(a);
		}
		//値,誤差値でハッシュ。
		map<int,int> hash;
		hash[128]=0;

		int _mi;int _mindex=-1;
		for(int i=0;i<n;i++){
			int d=data[i];//次のデータ
			map<int,int>::iterator it = hash.begin();		
			map<int,int> next_hash;
			map<int,int>::iterator next_hash_end=next_hash.end();
			//最小値とdの間のみ保存。
			while( it != hash.end() )
			{
				for(int k=0;k<m;k++){
					int f=max(min((*it).first+codebook[k],255),0);
					int div=f-d;
					int s=(*it).second+div*div;
					if(_mindex==-1 || min(_mindex,d)<=f && f<=max(_mindex,d)){
						if(next_hash.find(f)!= next_hash_end){
							next_hash[f]=min(next_hash[f],s);
						}else{
							next_hash[f]=s;
						}
					}
				}
				++it;
			}


			hash=next_hash;

			_mi=INT_MAX;
			map<int,int>::iterator _it = hash.begin();
			while( _it != hash.end() )
			{
				if((*_it).second<=_mi){				
					_mi=(*_it).second;
					_mindex=(*_it).first;
				}
				_it++;
			}

		}
		int mi=INT_MAX;
		map<int,int>::iterator it = hash.begin();
		while( it != hash.end() )
		{
			mi=min((*it).second,mi);
			it++;
		}
		cout << mi <<endl;
	}
}

C++: #include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <utility>
#include <cstring>
#include <iomanip>
#include <numeric>
#include <cmath>
#include <cassert>
using namespace std;
using ll = long long;
const int INF = 1<<30;
const int MOD = (int)1e9 + 7;
const int MAX_N = (int)1e5 + 5;
#define debug(x) cout << #x << ": " << x << endl
template<typename T>
ostream &operator<<(ostream &os, const vector<T> &v) { for(int i = 0; i < (int) v.size(); i++) os << v[i] << (i + 1 != v.size() ? " " : ""); return os; }
int N, M;
vector<int> C, x;
int dp[20010][260];
int dfs(int pos, int py)
{
    if(pos >= N) return 0;
    if(dp[pos][py]) return dp[pos][py];
    int res = INF;
    for(int i = 0; i < M; i++)
    {
        int y = py + C[i];
        if(y < 0) y = 0;
        if(y > 255) y = 255;
        res = min(res, dfs(pos + 1, y) + (x[pos] - y) * (x[pos] - y));
    }
    return dp[pos][py] = res;
}
signed main(void)
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    while(cin >> N >> M, N or M)
    {
        memset(dp, 0, sizeof(dp));
        C.resize(M);
        x.resize(N);
        for(int i = 0; i < M; i++) cin >> C[i];
        for(int i = 0; i < N; i++) cin >> x[i];
        cout << dfs(0, 128) << endl;
    }
    return 0;
}

C++: #include <iostream>
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <queue>
#include <numeric>
#include <string>
#include <string.h>
#include <map>
#include <set>
#include <functional>
#include <complex>
#include <stack>
#include <tuple>

#define ll long long int

using namespace std;

const int INF = (1<<30) - 1;


int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    
    int N, M;
    while(cin>>N>>M, N|M){
        vector<int> code_book(M);
        vector<int> data(N);
        for(auto &c: code_book)
            cin >> c;
        for(auto &d: data)
            cin >> d;
        
        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++){
                for(auto c: code_book){
                    int ni = min(255, max(0, j+c));
                    auto &next = dp[i+1][ni];
                    int error = (ni-data[i])*(ni-data[i]);
                    next = min(next, dp[i][j]+error);
                }
            }
        }
        
        int ans = INF;
        for(auto &t: dp[N])
            ans = min(ans, t);
        cout << ans << endl;
    }
    
    return 0;
}