Submission #2586557

Source Code Expand

main=do
 [n,s,t]<-map read.words<$>getLine
 let a=solve s t
 print$if a<0 then -1 else a
solve s t=if s>t then -100 else if s==t then 0 else 1+solve s (div t 2)

Submission Info

Submission Time
Task B - Camphor Tree
User kotatsugame
Language Haskell (GHC 7.10.3)
Score 100
Code Size 166 Byte
Status AC
Exec Time 2 ms
Memory 508 KB

Judge Result

Set Name All
Score / Max Score 100 / 100
Status
AC × 13
Set Name Test Cases
All 00_sample, 01_sample, 02_sample, max_01, max_02, max_03, max_04, max_05, max_06, max_07, max_08, max_09, min_00
Case Name Status Exec Time Memory
00_sample AC 2 ms 380 KB
01_sample AC 2 ms 508 KB
02_sample AC 2 ms 508 KB
max_01 AC 2 ms 508 KB
max_02 AC 2 ms 508 KB
max_03 AC 2 ms 508 KB
max_04 AC 1 ms 380 KB
max_05 AC 2 ms 508 KB
max_06 AC 2 ms 508 KB
max_07 AC 2 ms 508 KB
max_08 AC 1 ms 508 KB
max_09 AC 2 ms 508 KB
min_00 AC 2 ms 508 KB