Submission #3711654

Source Code Expand

N, S, T = map(int, input().split())

if S>T:
  print(-1)
  exit(0)
  
ans = 0
while S<T:
  T = T // 2
  ans += 1

print(ans)

Submission Info

Submission Time
Task B - Camphor Tree
User mo2
Language Python (3.4.3)
Score 0
Code Size 135 Byte
Status WA
Exec Time 18 ms
Memory 2940 KB

Judge Result

Set Name All
Score / Max Score 0 / 100
Status
AC × 12
WA × 1
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 18 ms 2940 KB
01_sample AC 18 ms 2940 KB
02_sample AC 17 ms 2940 KB
max_01 AC 18 ms 2940 KB
max_02 AC 18 ms 2940 KB
max_03 AC 18 ms 2940 KB
max_04 AC 17 ms 2940 KB
max_05 AC 18 ms 2940 KB
max_06 AC 18 ms 2940 KB
max_07 WA 17 ms 2940 KB
max_08 AC 17 ms 2940 KB
max_09 AC 18 ms 2940 KB
min_00 AC 17 ms 2940 KB