提出 #64548100

---

ソースコード 拡げる

package main

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

type pair struct {
	x, y int
}

type tuple struct {
	x, y, z int
}

type myType interface {
	int | int64 | float64 | string | rune | byte
}

type additionalTypes interface {
	bool | pair | tuple
}

func readArr[T myType](n int) []T {
	arr := make([]T, n)
	for i := 0; i < n; i++ {
		fmt.Fscan(in, &arr[i])
	}
	return arr
}

func createArr[T myType | additionalTypes](n int, val T) []T {
	arr := make([]T, n)
	for i := 0; i < n; i++ {
		arr[i] = val
	}
	return arr
}

func readMat[T myType](n, m int) [][]T {
	mat := make([][]T, n)
	for i := 0; i < n; i++ {
		row := make([]T, m)
		for j := 0; j < n; j++ {
			fmt.Fscan(in, &row[j])
		}
		mat[i] = row
	}
	return mat
}

func createMat[T myType | additionalTypes](n, m int, val T) [][]T {
	mat := make([][]T, n)
	for i := 0; i < n; i++ {
		row := make([]T, m)
		for j := 0; j < n; j++ {
			row[j] = val
		}
		mat[i] = row
	}
	return mat
}

func min[T myType](a, b T) T {
	if a < b {
		return a
	}
	return b
}

func max[T myType](a, b T) T {
	if a > b {
		return a
	}
	return b
}

var mod = int(1e9 + 7)

func invMod(a int) int {
	return pow(a, mod-2)
}

func pow(a, b int) int {
	res := 1
	for b > 0 {
		if b&1 == 1 {
			res = (res * a) % mod
		}
		a = (a * a) % mod
		b >>= 1
	}
	return res
}

var (
	in  = bufio.NewReader(os.Stdin)
	out = bufio.NewWriter(os.Stdout)
)

func main() {
	defer out.Flush()

	var n int64
	fmt.Fscan(in, &n)

	ans := int64(0)
	for i := int64(2); i <= n; i *= 2 {
		val := int64(math.Sqrt(float64(n / i)))
		ans += (val + 1) / 2
	}
	fmt.Fprintln(out, ans)
}

提出情報

ジャッジ結果