For problem statement at 1000-1999/1900-1999/1970-1979/1970/problemB1.txt this is a correct solution, but verifier at 1000-1999/1900-1999/1970-1979/1970/verifierB1.go ends with case 1 failed: expected:
YES
1 1
2 2
3 3
4 4
5 5
6 6
7 7
8 8
3 1 6 4 1 4 4 5
got:
YES
1 1
2 2
3 3
4 4
5 5
6 6
7 7
8 8
3 3 6 4 1 8 4 5
input:
8
4 2 6 0 8 4 6 6
exit status 1 can you fix the verifier? package main

import (
	"bufio"
	"bytes"
	"os"
	"strconv"
)

type FastScanner struct {
	r *bufio.Reader
}

func NewFastScanner() *FastScanner {
	return &FastScanner{r: bufio.NewReaderSize(os.Stdin, 1<<20)}
}

func (fs *FastScanner) NextInt() int {
	sign, val := 1, 0
	c, _ := fs.r.ReadByte()
	for (c < '0' || c > '9') && c != '-' {
		c, _ = fs.r.ReadByte()
	}
	if c == '-' {
		sign = -1
		c, _ = fs.r.ReadByte()
	}
	for c >= '0' && c <= '9' {
		val = val*10 + int(c-'0')
		c, _ = fs.r.ReadByte()
	}
	fs.r.UnreadByte()
	return sign * val
}

func main() {
	fs := NewFastScanner()
	n := fs.NextInt()
	a := make([]int, n+1)
	for i := 1; i <= n; i++ {
		a[i] = fs.NextInt()
	}

	var out bytes.Buffer
	out.WriteString("YES\n")
	for i := 1; i <= n; i++ {
		out.WriteString(strconv.Itoa(i))
		out.WriteByte(' ')
		out.WriteString(strconv.Itoa(i))
		out.WriteByte('\n')
	}
	for i := 1; i <= n; i++ {
		var p int
		if a[i] == 0 {
			p = i
		} else {
			d := a[i] / 2
			if i+d <= n {
				p = i + d
			} else {
				p = i - d
			}
		}
		if i > 1 {
			out.WriteByte(' ')
		}
		out.WriteString(strconv.Itoa(p))
	}
	out.WriteByte('\n')

	os.Stdout.Write(out.Bytes())
}