답안 #519418

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
519418	2022-01-26T10:42:35 Z	Keshi	L-triominoes (CEOI21_ltriominoes)	C++17	0 / 100	1 ms	204 KB

ltrominoes

//In the name of God
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<ll, ll> pll;

const ll maxn = 2e5 + 100;
const ll mod = 1e9 + 7;
const ll inf = 1e18;

#define fast_io ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define file_io freopen("input.txt", "r+", stdin);freopen("output.txt", "w+", stdout);
#define pb push_back
#define Mp make_pair
#define F first
#define S second
#define Sz(x) ll((x).size())
#define all(x) (x).begin(), (x).end()

ll pw(ll a, ll b){
	ll c = 1;
	while(b){
		if(b & 1) c = c * a % mod;
		a = a * a % mod;
		b >>= 1;
	}
	return c;
}



int main(){
	fast_io;
	
	int n, m, k;
	cin >> n >> m >> k;
	if(n % 2 == 0 && m % 3 == 0) cout << "YES\n";
	else if(n % 3 == 0 && m % 2 == 0) cout << "YES\n";
  	else if(n % 6 == 0 && m % 6 == 5) cout << "YES\n";
  	else if(m % 6 == 0 && n % 6 == 5) cout << "YES\n";
	else cout << "NO\n";
	
	return 0;
}

Subtask #1
0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	0 ms	204 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #2
0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Incorrect	0 ms	204 KB	Output isn't correct
7	Halted	0 ms	0 KB	-

Subtask #3
0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Incorrect	1 ms	204 KB	Output isn't correct
5	Halted	0 ms	0 KB	-