Submission #6251057
Source Code Expand
package main
import (
"bufio"
"fmt"
"math"
"os"
"strconv"
)
const pi = math.Pi
var A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z int
var mod int = 10007
var ans int
func main() {
reader.Split(bufio.ScanWords)
H1, _ := strconv.Atoi(read())
H2, _ := strconv.Atoi(read())
fmt.Println(H1 - H2)
}
/* ---------------------------------------- */
var reader = bufio.NewScanner(os.Stdin)
func read() string {
reader.Scan()
return reader.Text()
}
func lcm(x, y int) int {
return (x / gcd(x, y)) * y
}
func gcd(x, y int) int {
if x%y == 0 {
return y
} else {
r := x % y
return gcd(y, r)
}
}
var fac [1000000]int
var finv [1000000]int
var inv [1000000]int
func combination_init() {
fac[0], fac[1] = 1, 1
finv[0], finv[1] = 1, 1
inv[1] = 1
// invは a^(-1) mod p
// pをaで割ることを考える
// p/a*(a) + p%a = p
// p/a*(a) + p%a = 0 (mod p)
// -p%a = p/a*(a) (mod p)
// -p%a *a^(-1)= p/a (mod p)
// a^(-1)= p/a * (-p%a)^(-1) (mod p)
// a^(-1) =
for i := 2; i < 1000000; i++ {
fac[i] = fac[i-1] * i % mod
inv[i] = mod - inv[mod%i]*(mod/i)%mod
finv[i] = finv[i-1] * inv[i] % mod
}
}
func combination(x, y int) int {
if x < y {
return 0
}
if fac[0] != 1 {
combination_init()
}
return fac[x] * (finv[y] * finv[x-y] % mod) % mod
//return fac[x] / (fac[y] * fac[x-y])
}
func permutation(x, y int) int {
if x < y {
return 0
}
if fac[0] != 1 {
combination_init()
}
return fac[x] * (finv[x-y] % mod) % mod
//return fac[x] / fac[x-y]
}
func max(x ...int) int {
var res int = x[0]
for i := 1; i < len(x); i++ {
res = int(math.Max(float64(x[i]), float64(res)))
}
return res
}
func min(x ...int) int {
var res int = x[0]
for i := 1; i < len(x); i++ {
res = int(math.Min(float64(x[i]), float64(res)))
}
return res
}
func pow(x, y int) int { return int(math.Pow(float64(x), float64(y))) }
func abs(x int) int { return int(math.Abs(float64(x))) }
func floor(x int) int { return int(math.Floor(float64(x))) }
func ceil(x int) int { return int(math.Ceil(float64(x))) }
type SortBy []int
func (a SortBy) Len() int { return len(a) }
func (a SortBy) Swap(i, j int) { a[i], a[j] = a[j], a[i] }
func (a SortBy) Less(i, j int) bool { return a[i] > a[j] }
type PriorityQueue []int
func (h PriorityQueue) Len() int { return len(h) }
func (h PriorityQueue) Less(i, j int) bool { return h[i] < h[j] }
func (h PriorityQueue) Swap(i, j int) { h[i], h[j] = h[j], h[i] }
func (h *PriorityQueue) Push(x interface{}) { *h = append(*h, x.(int)) }
func (h *PriorityQueue) Pop() interface{} {
old := *h
n := len(old)
x := old[n-1]
*h = old[0 : n-1]
return x
}
Submission Info
Submission Time |
|
Task |
A - 積雪深差 |
User |
Kosuke_S |
Language |
Go (1.6) |
Score |
100 |
Code Size |
2852 Byte |
Status |
AC |
Exec Time |
1 ms |
Memory |
640 KB |
Judge Result
Set Name |
all |
Score / Max Score |
100 / 100 |
Status |
|
Set Name |
Test Cases |
all |
00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt |
Case Name |
Status |
Exec Time |
Memory |
00_sample_01.txt |
AC |
1 ms |
640 KB |
00_sample_02.txt |
AC |
1 ms |
640 KB |
00_sample_03.txt |
AC |
1 ms |
640 KB |
test_01.txt |
AC |
1 ms |
640 KB |
test_02.txt |
AC |
1 ms |
640 KB |
test_03.txt |
AC |
1 ms |
640 KB |
test_04.txt |
AC |
1 ms |
640 KB |
test_05.txt |
AC |
1 ms |
640 KB |
test_06.txt |
AC |
1 ms |
640 KB |
test_07.txt |
AC |
1 ms |
640 KB |
test_08.txt |
AC |
1 ms |
640 KB |
test_09.txt |
AC |
1 ms |
640 KB |
test_10.txt |
AC |
1 ms |
640 KB |
test_11.txt |
AC |
1 ms |
640 KB |
test_12.txt |
AC |
1 ms |
640 KB |
test_13.txt |
AC |
1 ms |
640 KB |
test_14.txt |
AC |
1 ms |
640 KB |
test_15.txt |
AC |
1 ms |
640 KB |
test_16.txt |
AC |
1 ms |
640 KB |
test_17.txt |
AC |
1 ms |
640 KB |