Submission #23965936
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
#define f(i,n) for(i=0;i<n;i++)
#define f1(i,n) for(i=1;i<n;i++)
#define fr(i,n) for(i=n-1;i>=0;i--)
#define em emplace_back
#define mp make_pair
#define in insert
#define fi first
#define sc second
#define b begin
#define e end
#define l length
#define c clear
#define si size
#define fastio ios_base::sync_with_stdio(false);cin.tie(0);
const double pi=3.141592653;
const ll infi=1000000001;
// const ll mod=1000000007;
// const ll mod=998244353;
const string no="NO\n",yes="YES\n",nl="\n";
// void dfs(vl v[],ll node,ll hai[]){
// hai[node]=1;
// for(auto i:v[node]){
// if(hai[i]==0){
// dfs(v,i,hai);
// }
// }
// }
// ll recur(vl v,ll in,ll m,ll n){
// if(in==-1) return 1000000000001;
// ll d,e,c;
// d=max(m/v[in],n*v[in]);
// c=recur(v,in-1,m/v[in],n*v[in]);
// e=recur(v,in-1,m,n);
// return min(c,min(e,d));
// }
// ll bexpo(ll a,ll p){
// ll x=1;
// while(p){
// if(p&1){
// x=(x*a)%mod;
// }
// a=(a*a)%mod;
// p>>=1;
// }
// return x;
// }
// int dx[8]{-1,0,0,1,-1,-1,1,1};
// int dy[8]{0,-1,1,0,-1,1,-1,1};
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
fastio
int t=1;
// cin>>t;
ll n,m,i,l,bank,k,j,x,y,ans,q;
// string s;
while(t--){ans=0;
cin>>n>>m;
if(n*6>=m && m>=n) cout<<"Yes\n";
else cout<<"No\n";
}
return 0;
}
Submission Info
| Submission Time |
|
| Task |
A - Rolling Dice |
| User |
nikIITP18 |
| Language |
C++ (GCC 9.2.1) |
| Score |
100 |
| Code Size |
1788 Byte |
| Status |
AC |
| Exec Time |
7 ms |
| Memory |
3644 KiB |
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:71:12: warning: unused variable ‘i’ [-Wunused-variable]
71 | ll n,m,i,l,bank,k,j,x,y,ans,q;
| ^
./Main.cpp:19:11: warning: unused variable ‘length’ [-Wunused-variable]
19 | #define l length
| ^~~~~~
./Main.cpp:71:14: note: in expansion of macro ‘l’
71 | ll n,m,i,l,bank,k,j,x,y,ans,q;
| ^
./Main.cpp:71:16: warning: unused variable ‘bank’ [-Wunused-variable]
71 | ll n,m,i,l,bank,k,j,x,y,ans,q;
| ^~~~
./Main.cpp:71:21: warning: unused variable ‘k’ [-Wunused-variable]
71 | ll n,m,i,l,bank,k,j,x,y,ans,q;
| ^
./Main.cpp:71:23: warning: unused variable ‘j’ [-Wunused-variable]
71 | ll n,m,i,l,bank,k,j,x,y,ans,q;
| ^
./Main.cpp:71:25: warning: unused variable ‘x’ [-Wunused-variable]
71 | ll n,m,i,l,bank,k,j,x,y,ans,q;
| ^
./Main.cpp:71:27: warning: unused variable ‘y’ [-Wunused-variable]
71 | ll n,m,i,l,bank,k,j,x,y,ans,q;
| ^
./Main.cpp:71:29: warning: variable ‘ans’ set but not used [-Wunused-but-set-variable]
71 | ll n,m,i,l,bank,k,j,x,y,ans,q;
| ^~~
./Main.cpp:71:33: warning: unused variable ‘q’ [-Wunused-variable]
71 | ll n,m,i,l,bank,k,j,x,y,ans,q;
| ^
Judge Result
| Set Name |
Sample |
All |
| Score / Max Score |
0 / 0 |
100 / 100 |
| Status |
|
|
| Set Name |
Test Cases |
| Sample |
sample_00.txt, sample_01.txt, sample_02.txt |
| All |
bound_00.txt, bound_01.txt, bound_02.txt, bound_03.txt, random_00.txt, random_01.txt, sample_00.txt, sample_01.txt, sample_02.txt |
| Case Name |
Status |
Exec Time |
Memory |
| bound_00.txt |
AC |
7 ms |
3532 KiB |
| bound_01.txt |
AC |
2 ms |
3592 KiB |
| bound_02.txt |
AC |
2 ms |
3540 KiB |
| bound_03.txt |
AC |
2 ms |
3592 KiB |
| random_00.txt |
AC |
2 ms |
3592 KiB |
| random_01.txt |
AC |
2 ms |
3644 KiB |
| sample_00.txt |
AC |
2 ms |
3520 KiB |
| sample_01.txt |
AC |
2 ms |
3540 KiB |
| sample_02.txt |
AC |
2 ms |
3620 KiB |