F.A.Q
Hand In Hand
Online Acmers
Problem Archive
Realtime Judge Status
Authors Ranklist
 
     C/C++/Java Exams     
ACM Steps
Go to Job
Contest LiveCast
ICPC@China
Best Coder beta
VIP | STD Contests
    DIY | Web-DIY beta
Author ID 
Password 
 Register new ID

Dominoes

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 271    Accepted Submission(s): 136


Problem Description

Some day, Tom's father buys him a box of dominoes blocks. In the box, there are 12 different blocks, which are shown above. Tom is a boy who likes to do practice in intelligence, so he spends a whole afternoon in finishing two different rectangles with 3 * 20, which are shown below.

٢ݢݢݢݢޢޢڢڢڢڢڢۢܢ
٢ݢТТޢޢߢϢϢۢۢۢ
٢٢٢ТТТޢߢߢߢߢϢϢϢۢܢ

٢ߢߢߢߢޢТТТڢڢڢڢڢۢܢ
٢ߢޢޢТТݢϢϢۢۢۢ
٢٢٢ޢޢݢݢݢݢϢϢϢۢܢ

Tom is sure that these are the only solutions for 3 * 20, and he wants to know the number of solutions for 4 * 15, 5 * 12, ... Can you help him?

You should notice that if a solution will be the same as the other by some flip or rotate, these two solutions should be consider as the same.
 

Input
There may be several test cases. Each contains a single line with two positive integers M and N, which means the shape of M * N. Here M * N = 60.
 

Output
For each test case, output a line contains the number of solutions.
 

Sample Input
1 60 3 20
 

Sample Output
0 2
 

Source
 

Statistic | Submit | Discuss | Note
Hangzhou Dianzi University Online Judge 3.0
Copyright © 2005-2024 HDU ACM Team. All Rights Reserved.
Designer & Developer : Wang Rongtao LinLe GaoJie GanLu
Total 0.000000(s) query 1, Server time : 2024-05-31 05:19:17, Gzip enabled