Submission #3246495
Source Code Expand
//#include <bits/stdc++.h> //#include <stdio.h> #include<iostream> #include<cstdio> #include<bitset> #include<algorithm> #include<vector> #include<list> #include<queue> #include<stack> #include<string> #include<string.h> #include<cmath> #include<utility> #include<functional> #include<map> #include<set> #include<cctype> #include<fstream> #include <numeric> #include <iomanip> #define FOR(i, a, b) for( int i=(a);i<=(b);i++) #define RFOR(i, a, b) for( int i=(a);i>=(b);i--) #define LFOR(i, a, b) for( long long int i=(a);i<=(b);i++) #define LRFOR(i, a, b) for(long long int i=(a);i>=(b);i--) #define MOD 1000000007 using namespace std; using ll=long long; constexpr ll gcd(ll a,ll b){return b?gcd(b,a%b):a;} constexpr ll lcm(ll a,ll b){return a*b/gcd(a,b);} int main() { ll X,Y; string N; int n=0; int nmax=0; int ans=0; cin >> X>>Y; ll syou = Y/X; while(syou!=0){ syou=syou/2; ans++; } cout << ans<< endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Multiple Gift |
User | kenkyu46 |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 996 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 300 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | s1.txt, s2.txt, s3.txt |
All | 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, s1.txt, s2.txt, s3.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01.txt | AC | 1 ms | 256 KB |
02.txt | AC | 1 ms | 256 KB |
03.txt | AC | 1 ms | 256 KB |
04.txt | AC | 1 ms | 256 KB |
05.txt | AC | 1 ms | 256 KB |
06.txt | AC | 1 ms | 256 KB |
07.txt | AC | 1 ms | 256 KB |
08.txt | AC | 1 ms | 256 KB |
09.txt | AC | 1 ms | 256 KB |
10.txt | AC | 1 ms | 256 KB |
11.txt | AC | 1 ms | 256 KB |
12.txt | AC | 1 ms | 256 KB |
s1.txt | AC | 1 ms | 256 KB |
s2.txt | AC | 1 ms | 256 KB |
s3.txt | AC | 1 ms | 256 KB |