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<vector>

using namespace std;
using ll = long long;

const ll mx = 1LL << 62;
ll dp[20002][256];

int main() {
    while (1) {
        int n, m;
        cin >> n >> m;

        if (n == 0 && m == 0) break;

        vector<int> c;
        vector<int> x;

        for (int i = 0; i < m; ++i) {
            int ci;
            cin >> ci;
            c.push_back(ci);
        }

        for (int i = 0; i < n; ++i) {
            int xi;
            cin >> xi;
            x.push_back(xi);
        }

        int y = 128;

        for (int i = 0; i <= n + 1; ++i) {
            for (int j = 0; j < 256; ++j) {
                dp[i][j] = -1;
            }
        }
        dp[0][128] = 0;
        
        for (int i = 0; i < n; ++i) {
            int next = x[i];
            for (int j = 0; j < m; ++j) {
                int cj = c[j];
                for (int k = 0; k < 256; ++k) {
                    if (dp[i][k] == -1) continue;
                    int high = max(min(255, k + cj), 0);
                    int cost = (high - next) * (high - next);
                    dp[i + 1][high] = min((dp[i+ 1][high] == -1 ? mx : dp[i+ 1][high]), dp[i][k] + cost);
                }
            }
            // for (int k = 128; k < 256; ++k) {
            //     cout << dp[i + 1][k] << " ";
            // }
            //cout << endl;
        }

        ll mincost = mx;
        for (int i = 0; i < 256; ++i) {
            if (dp[n][i] < mincost && dp[n][i] != -1) mincost = dp[n][i];
        }
        cout << mincost << endl;

    }
}

C++: #include "algorithm"
#include "cmath"
#include "iostream"
#include "map"
#include "string"
#include "unordered_map"
#include "vector"

constexpr int MOD           = 1e9 + 7;
constexpr int long long INF = 1e18;
using namespace std;

int long long dp[20000 + 10][256];
int C[16], X[20000 + 10];
int main() {
  int N, M;
  cin >> N >> M;
  while (N != 0 || M != 0) {
    for (auto &i : dp) {
      for (auto &j : i) {
        j = INF;
      }
    }
    for (int i = 0; i < M; i++) {
      cin >> C[i];
    }
    for (int i = 0; i < N; i++) {
      cin >> X[i];
    }
    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] < 0) {
            dp[i + 1][0] = min(dp[i + 1][0], dp[i][j] + X[i] * X[i]);
          } else if (j + C[k] > 255) {
            dp[i + 1][255] = min(dp[i + 1][255], dp[i][j] + (X[i] - 255) * (X[i] - 255));
          } else {
            dp[i + 1][j + C[k]] = min(dp[i + 1][j + C[k]], dp[i][j] + (X[i] - (j + C[k])) * (X[i] - (j + C[k])));
          }
        }
      }
    }
    cout << *min_element(dp[N], dp[N] + 256) << endl;
    cin >> N >> M;
  }
}

C++: #include <iostream>
#include <algorithm>
#include <iomanip>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>

static const int MOD = 1000000007;
using ll = long long;
using u32 = uint32_t;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max() / 32 * 15 + 208;

int main() {
    int n, m;
    vector<vector<int>> dp(2, vector<int>(256, INF<int>));
    while(cin >> n >> m, n){
        vector<int> c(m), x(n);
        for (auto &&i : c) scanf("%d", &i);
        for (auto &&i : x) scanf("%d", &i);
        for (int i = 0; i < 2; ++i) {
            fill(dp[i].begin(),dp[i].end(), INF<int>);
        }
        dp[0][128] = 0;
        for (int i = 0; i < n; ++i) {
            int now = i&1, nxt = now^1;
            fill(dp[nxt].begin(),dp[nxt].end(), INF<int>);
            for (int j = 0; j < 256; ++j) {
                for (int k = 0; k < m; ++k) {
                    int to = max(0, min(255,j+c[k]));
                    dp[nxt][to] = min(dp[nxt][to], dp[now][j]+(x[i]-to)*(x[i]-to));
                }
            }
        }
        cout << *min_element(dp[n&1].begin(),dp[n&1].end()) << "\n";
    }
    return 0;
}

C++: #include<stdio.h>
#include<string.h>
#include<math.h>
#define min(a,b) (a>b?b:a)
int N,M,C[20],x[20005];
long long res,dp[20005][20][2]={0};
int main()
{
	for(;scanf("%d%d",&N,&M),N+M;)
	{
		res=100000000000000;
		memset(dp,0x7f,sizeof(dp));
		for(int i=0;i<M;i++)scanf("%d",&C[i]);
		for(int j=1;j<=N;j++)scanf("%d",&x[j]);
		for(int i=0;i<M;i++)
		{
			dp[0][i][0]=128;
			dp[0][i][1]=0;
		}
		for(int i=1;i<=N;i++)
		{
			for(int k=0;k<M;k++)
				for(int j=0;j<M;j++)
				{
					int p=dp[i-1][k][0]+C[j];
					if(p>255)p=255;
					if(p<0)p=0;
					int a=x[i]-p;
					int tmp=a*a;
					if(dp[i-1][k][1]+tmp<dp[i][j][1])
					{
						dp[i][j][1]=dp[i-1][k][1]+tmp;
						dp[i][j][0]=p;
					}
				}
		}
		for(int i=0;i<M;i++)
			res=min(res,dp[N][i][1]);
		printf("%lld\n",res);
	}
	return 0;
}