Submission #998826


Source Code Expand

package main

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

func main() {
	sc := NewScanner()
	R1 := float64(sc.NextInt())
	R2 := float64(sc.NextInt())

	fmt.Println(R1 * R2 / (R1 + R2))

}

type Scanner struct {
	r   *bufio.Reader
	buf []byte
	p   int
}

func NewScanner() *Scanner {
	rdr := bufio.NewReaderSize(os.Stdin, 1000)
	return &Scanner{r:rdr}
}
func (s *Scanner) Next() string {
	s.pre()
	start := s.p
	for ; s.p < len(s.buf); s.p++ {
		if s.buf[s.p] == ' ' {
			break
		}
	}
	result := string(s.buf[start:s.p])
	s.p++
	return result
}
func (s *Scanner) NextLine() string {
	s.pre()
	start := s.p
	s.p = len(s.buf)
	return string(s.buf[start:])
}
func (s *Scanner) NextInt() int {
	v, _ := strconv.Atoi(s.Next())
	return v
}

func (s *Scanner) NextIntArray() []int {
	s.pre()
	start := s.p
	result := []int{}
	for ; s.p < len(s.buf); s.p++ {
		if s.buf[s.p] == ' ' {
			v, _ := strconv.Atoi(string(s.buf[start:s.p]))
			result = append(result, v)
			start = s.p + 1
		}
	}
	v, _ := strconv.Atoi(string(s.buf[start:s.p]))
	result = append(result, v)

	return result
}

func (s *Scanner) NextMap() map[int]bool {
	s.pre()
	start := s.p
	mp := map[int]bool{}
	for ; s.p < len(s.buf); s.p++ {
		if s.buf[s.p] == ' ' {
			v, _ := strconv.Atoi(string(s.buf[start:s.p]))
			mp[v] = true
			start = s.p + 1
		}
	}
	v, _ := strconv.Atoi(string(s.buf[start:s.p]))
	mp[v] = true

	return mp
}

func (s *Scanner) pre() {
	if s.p >= len(s.buf) {
		s.readLine()
		s.p = 0
	}
}
func (s *Scanner) readLine() {
	s.buf = make([]byte, 0)
	for {
		l, p, e := s.r.ReadLine()
		if e != nil {
			panic(e)
		}
		s.buf = append(s.buf, l...)
		if !p {
			break
		}
	}
}

Submission Info

Submission Time
Task A - Equivalent Resistance
User yuki2006
Language Go (1.6)
Score 100
Code Size 1759 Byte
Status AC
Exec Time 3 ms
Memory 640 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 2
AC × 21
Set Name Test Cases
Sample sample_01.txt, sample_02.txt
All sample_01.txt, sample_02.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt
Case Name Status Exec Time Memory
sample_01.txt AC 3 ms 640 KB
sample_02.txt AC 3 ms 640 KB
subtask1_01.txt AC 3 ms 640 KB
subtask1_02.txt AC 2 ms 640 KB
subtask1_03.txt AC 2 ms 640 KB
subtask1_04.txt AC 3 ms 640 KB
subtask1_05.txt AC 3 ms 640 KB
subtask1_06.txt AC 3 ms 640 KB
subtask1_07.txt AC 3 ms 640 KB
subtask1_08.txt AC 2 ms 640 KB
subtask1_09.txt AC 2 ms 640 KB
subtask1_10.txt AC 2 ms 640 KB
subtask1_11.txt AC 2 ms 640 KB
subtask1_12.txt AC 3 ms 640 KB
subtask1_13.txt AC 2 ms 640 KB
subtask1_14.txt AC 3 ms 640 KB
subtask1_15.txt AC 2 ms 640 KB
subtask1_16.txt AC 2 ms 640 KB
subtask1_17.txt AC 3 ms 640 KB
subtask1_18.txt AC 2 ms 640 KB
subtask1_19.txt AC 3 ms 640 KB