#78180 (Go) No.40 多項式の割り算

• 問題: No.40 多項式の割り算
• ユーザー: yukirin
• 提出日時: 2016-02-26 18:57:44
• 言語: Go (1.22.1)
• 結果: AC
• 実行時間: 199 ms / 5,000 ms
• コード長: 3,361 bytes
• コンパイル時間: 11,194 ms
• コンパイル使用メモリ: 222,164 KB
• 実行使用メモリ: 6,816 KB
• 最終ジャッジ日時: 2024-10-10 22:55:06
• 合計ジャッジ時間: 14,221 ms
• ジャッジサーバーID （参考情報）: judge4 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 6,816 KB
testcase_01	AC	1 ms; 5,248 KB
testcase_02	AC	1 ms; 5,248 KB
testcase_03	AC	1 ms; 5,248 KB
testcase_04	AC	71 ms; 5,248 KB
testcase_05	AC	108 ms; 5,248 KB
testcase_06	AC	174 ms; 5,248 KB
testcase_07	AC	196 ms; 5,480 KB
testcase_08	AC	2 ms; 5,248 KB
testcase_09	AC	95 ms; 5,248 KB
testcase_10	AC	161 ms; 5,248 KB
testcase_11	AC	58 ms; 5,248 KB
testcase_12	AC	25 ms; 5,248 KB
testcase_13	AC	157 ms; 5,324 KB
testcase_14	AC	69 ms; 5,248 KB
testcase_15	AC	69 ms; 5,248 KB
testcase_16	AC	159 ms; 5,364 KB
testcase_17	AC	13 ms; 5,376 KB
testcase_18	AC	141 ms; 5,372 KB
testcase_19	AC	199 ms; 5,460 KB
testcase_20	AC	49 ms; 5,324 KB
testcase_21	AC	11 ms; 5,248 KB
testcase_22	AC	8 ms; 5,248 KB
testcase_23	AC	50 ms; 5,324 KB
testcase_24	AC	107 ms; 5,308 KB
testcase_25	AC	1 ms; 5,248 KB
testcase_26	AC	1 ms; 5,248 KB
testcase_27	AC	2 ms; 5,248 KB
testcase_28	AC	1 ms; 5,248 KB
testcase_29	AC	1 ms; 5,248 KB
testcase_30	AC	1 ms; 5,248 KB
testcase_31	AC	1 ms; 5,248 KB
testcase_32	AC	2 ms; 5,248 KB
testcase_33	AC	1 ms; 5,248 KB
testcase_34	AC	1 ms; 5,248 KB

ソースコード

package main

import (
	"bufio"
	"fmt"
	"math"
	"os"
	"strconv"
	"strings"
)

var sc = bufio.NewScanner(os.Stdin)
var rdr = bufio.NewReaderSize(os.Stdin, 1000000)

func main() {
	sc.Split(bufio.ScanWords)
	d := nextInt()
	as, m := make([]int, d+1), make([]int, d+1)
	if d >= 3 {
		m[3], m[1] = 1, -1
	}
	for i := 0; i <= d; i++ {
		as[i] = nextInt()
	}

	for i := d; i >= 3; i-- {
		if as[i] == 0 {
			continue
		}

		tmp, diff := make([]int, d+1), i-3
		copy(tmp, m)
		for j := 3; j >= 0; j-- {
			tmp[j+diff] = tmp[j] * as[i]
			if diff != 0 {
				tmp[j] = 0
			}
		}

		for j := 0; j <= d; j++ {
			as[j] -= tmp[j]
		}
	}

	index := 0
	for i := d; i >= 0; i-- {
		if as[i] != 0 {
			index = i
			break
		}
	}

	fmt.Println(index)
	s := make([]string, 0, 4)
	for _, v := range as[:index+1] {
		s = append(s, fmt.Sprint(v))
	}

	fmt.Println(strings.Join(s, " "))
}

func nextLine() string {
	sc.Scan()
	return sc.Text()
}

func nextInt() int {
	i, _ := strconv.Atoi(nextLine())
	return i
}

func nextInt64() int64 {
	i, _ := strconv.ParseInt(nextLine(), 10, 64)
	return i
}

func nextUint64() uint64 {
	i, _ := strconv.ParseUint(nextLine(), 10, 64)
	return i
}

func nextFloat() float64 {
	f, _ := strconv.ParseFloat(nextLine(), 64)
	return f
}

func readLine() string {
	buf := make([]byte, 0, 1000000)
	for {
		l, p, e := rdr.ReadLine()
		if e != nil {
			panic(e)
		}
		buf = append(buf, l...)
		if !p {
			break
		}
	}
	return string(buf)
}

func factor(n uint64) []uint64 {
	if n <= 1 {
		return []uint64{n}
	}

	ps := make([]uint64, 0, 100)

	for i := uint64(2); i*i <= n; i++ {
		for n%i == 0 {
			n /= i
			ps = append(ps, i)
		}
	}
	if n > 1 {
		ps = append(ps, n)
	}
	return ps
}

func gcd(a, b uint64) uint64 {
	for ; b != 0; b, a = a%b, b {
	}
	return a
}

func exGcd(x, y int64) (a, b, c int64) {
	if x <= 0 || y <= 0 {
		return
	}

	r0, r1 := x, y
	a0, a1 := int64(1), int64(0)
	b0, b1 := int64(0), int64(1)

	for r1 > 0 {
		q1, r2 := r0/r1, r0%r1
		a2, b2 := a0-q1*a1, b0-q1*b1
		r0, r1 = r1, r2
		a0, a1 = a1, a2
		b0, b1 = b1, b2
	}
	a, b, c = a0, b0, r0
	return
}

func chinese(a1, m1, a2, m2 int64) int64 {
	a, _, c := exGcd(m1, m2)
	if c != 1 {
		return -1
	}

	x := a1 + (a2-a1)*a*m1
	for x < 0 {
		x += m1 * m2
	}
	return x
}

func lcm(a, b uint64) uint64 {
	return (a * b) / gcd(a, b)
}

func round(f float64, place int) float64 {
	shift := math.Pow10(place)
	return math.Floor(f*shift+.5) / shift
}

func round1(f float64) float64 {
	return math.Floor(f + .5)
}

func bitCount(n int64) int64 {
	c := int64(0)
	for i := uint(0); i < 64; i++ {
		if n>>i&1 == 1 {
			c++
		}
	}
	return c
}

func powExp(n, e uint64) uint64 {
	a := uint64(1)
	for e > 0 {
		if e&1 == 1 {
			a *= n
		}
		n *= n
		e >>= 1
	}
	return a
}

func powMod(n, e, mod uint64) uint64 {
	a := uint64(1)
	for e > 0 {
		if e&1 == 1 {
			a *= n
			a %= mod
		}
		n *= n
		n %= mod
		e >>= 1
	}
	return a % mod
}

func eratosthenes(n int) []int {
	if n < 2 {
		return []int{}
	}

	r := int(math.Floor(math.Sqrt(float64(n))))
	list := make([]bool, n+1)
	list[0], list[1] = true, true

	for i := 2; i <= r; i++ {
		if !list[i] {
			for j := i * i; j <= n; j += i {
				list[j] = true
			}
		}
	}

	l := n / int(math.Ceil(math.Log(float64(n))))
	primes := make([]int, 0, l)
	for i, v := range list {
		if v {
			continue
		}
		primes = append(primes, i)
	}

	return primes
}