-
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathRolling Dice.cpp
45 lines (41 loc) · 962 Bytes
/
Rolling Dice.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define int long long int
#define double double_t
#define INF 1e18
using namespace __gnu_pbds;
using namespace std;
template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
int GCD(int a, int b) {
if (b == 0) {
return a;
}
return GCD(b, a % b);
}
int power(int x, int y, int MOD = INF) {
if (y == 0) {
return 1;
}
if (y % 2 == 0) {
return power((x * x) % MOD, y / 2) % MOD;
} else {
return (x * power((x * x) % MOD, (y - 1) / 2) % MOD) % MOD;
}
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int t = 1;
while (t--) {
int a,b;
cin >> a>>b;
if (6*a>=b && a<=b){
cout<<"Yes\n";
} else{
cout<<"No\n";
}
}
}