Submission #2973071

Source Code Expand

#include <iostream>
using namespace std;

int main(){
  int n, s, t;
  cin >> n >> s >> t;
  int cnt=-1;
  bool flag=false;
  while(t>=s){
    if(t==s)flag=true;
    t/=2;
    cnt++;
  }
  cout << (flag ? cnt : -1) << endl;
  return 0;
}

Submission Info

Submission Time
Task B - Camphor Tree
User settyan117
Language C++14 (GCC 5.4.1)
Score 100
Code Size 252 Byte
Status AC
Exec Time 1 ms
Memory 256 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 1 ms 256 KB
01_sample AC 1 ms 256 KB
02_sample AC 1 ms 256 KB
max_01 AC 1 ms 256 KB
max_02 AC 1 ms 256 KB
max_03 AC 1 ms 256 KB
max_04 AC 1 ms 256 KB
max_05 AC 1 ms 256 KB
max_06 AC 1 ms 256 KB
max_07 AC 1 ms 256 KB
max_08 AC 1 ms 256 KB
max_09 AC 1 ms 256 KB
min_00 AC 1 ms 256 KB