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>
#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;
}

C++: #include<bits/stdc++.h>
using namespace std;
int main(){
  int n,m,c[16],x[20001];
  int dp1[256],dp2[256];

  while(cin>>n>>m,n|m){

  for(int i=0;i<m;i++) cin>>c[i];
  for(int i=1;i<n+1;i++) cin>>x[i];
  for(int j=0;j<256;j++) dp1[j]=1145141919;
  for(int j=0;j<256;j++) dp2[j]=1145141919;
  dp1[128]=0;
  
  for(int i=0;i<n;i++){
    for(int j=0;j<256;j++){
      if(dp1[j]!=1145141919){
        for(int k=0;k<m;k++){
          int tmp=j+c[k];
          if(tmp<0) tmp=0;
          if(tmp>255) tmp=255;
          dp2[tmp]=min(dp2[tmp],dp1[j]+(int)pow(x[i+1]-tmp,2));
        }
      }
    }
    for(int j=0;j<256;j++){
      dp1[j]=dp2[j];
      dp2[j]=1145141919;
    }
  }
  for(int i=1;i<256;i++) dp1[i]=min(dp1[i],dp1[i-1]);
  cout<<dp1[255]<<endl;
  }
  
  return 0;
}

C++: #include<cstdio>
#include<algorithm>

using namespace std;

const long long inf=1LL<<60;
long long memo[20000][256];

int main()
{
	for(int n,m;scanf("%d%d",&n,&m),n;){
		int c[16];
		static int x[20001];
		for(int i=0;i<m;i++)	scanf("%d",c+i);
		for(int i=0;i<n;i++)	scanf("%d",x+i);

		for(int i=0;i<=n;i++)for(int j=0;j<256;j++)	memo[i][j]=inf;

		memo[0][128]=0;
		for(int i=1;i<=n;i++){
			for(int j=0;j<256;j++){
				if(memo[i-1][j]==inf)	continue;
				for(int k=0;k<m;k++){
					int next=min(255,max(0,j+c[k]));
					memo[i][next]=min(memo[i][next],
						memo[i-1][j]+(next-x[i-1])*(next-x[i-1]));
				}
			}
		}

		long long emin=inf;
		for(int j=0;j<256;j++)	emin=min(emin,memo[n][j]);
		printf("%lld\n",emin);
	}

	return 0;
}

C++: #include <iostream>
#include <string>
#define REP(i,n) for(int i=0;i<(n);++i)
using namespace std;

int main(){
  while(true) {
    int N, M, C[16];
    cin >> N >> M;
    if(N == 0 && M == 0) break;
    REP(i, M) {
      cin >> C[i];
    }
    int sum[256], nsum[256];
    REP(i, 256) {
      sum[i] = i == 128 ? 0 : (1 << 30);
    }
    REP(i, N) { 
      int ty;
      cin >> ty;
      REP(j, 256) {
        nsum[j] = 9999999999;
      }
      REP(y, 256) {
        REP(k, M) {
          int ny = y + C[k];
          if(ny < 0) ny = 0;
          if(ny > 255) ny = 255;
          int d = ny - ty;
          int tsum = sum[y] + d * d;
          if(tsum < nsum[ny]) nsum[ny] = tsum;
        }
      }
      REP(j, 256) {
        sum[j] = nsum[j];
      }
    }
    int minsum = 999999999;
    REP(i, 256) {
      if(minsum > sum[i]) minsum = sum[i];
    }
    cout << minsum << endl;
  }
}