Submission #3226056
Source Code Expand
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef double long dl; typedef pair < int , int > pii; typedef pair < pii, pii > p2i; const int maxn = (int) 3e5 + 1; const int mod = (int) 1e9 + 7; const ll inf = (ll)1e18; #define acel ios_base :: sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL) #define next continue ll n, m, h; int main(){ cin >> n >> m; for(int i = 1; i <= 100; i++){ if(i == 1){ h = 1; } else { h *= 2; } if(n * h > m){ cout << i - 1; return 0; } } }
Submission Info
Submission Time | |
---|---|
Task | C - Multiple Gift |
User | RaBeka |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 641 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 |