Submission #617695

#	Time	Username	Problem	Language	Result	Execution time	Memory
617695		Mr_Husanboy	L-triominoes (CEOI21_ltriominoes)	C++14	7 / 100	1 ms	300 KiB

ltrominoes

#pragma GCC optimize("Ofast")

#include<bits/stdc++.h>


 
 
using namespace std;
using ll = long long;


 
mt19937 rng(123);
#define ld long double
#define ull unsigned long long 
#define ios ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define all(a) a.begin(), a.end()
#define ff first
#define ss second
#define vi vector<int>
#define vll vector<ll>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pld pair<ld,ld>
#define setp(x) setprecision(x)


ll mod=1e9+7;
int inf=1e9;
const int LOGN = 20;
const int MXX=3e5;

const long double PI = 3.1415926535897932384626433832795;







void solve(){
	ll n,m; cin >> n >> m;
	if((n*m)%3){
		cout << "NO";
	}else
	if((n*m)%6 == 0){
		cout << "YES";
	}else
	if(min(n,m)<=3){
		cout << "NO";
	}else cout << "YES";
}

 
int main(){
	int testcases = 1;
//	cin >> testcases;
	while(testcases --){
		solve(); if(testcases) cout << '\n';
	}
} 

• Subtask 1: 0 / 10
• Subtask 2: 7 / 7
• Subtask 3: 0 / 11
• Subtask 4: 0 / 17
• Subtask 5: 0 / 35
• Subtask 6: 0 / 20