The Templar Test

Problem code: KC205

All submissions for this problem are available.

Points:10

The greatest enemies of the Brotherhood of Brom in their days were the Templar Knights, a band of highly skilled assassins originally established in 1118 to protect pilgrims and the Holy Sepulcher. Like the Brotherhood s game of testing each other s wits, the Knights too had a game of their own.

The game was played on a board with squares arranged on rows and columns. The pieces used in the game attacked pieces that were either (a) two rows and one column away from its position, or (b) one row and two columns away from its position.

This is exactly the nature of the problem you have been presented with at the finals of the global race in Rio de Janeiro. I n order to develop an unbeatable algorithm for the game, you are to determine the largest number of game pieces that can be placed on a board with M rows and N columns so that no piece is attacking any other. M and N will each be no larger than 500.

Input

The first line of input consists of no of test cases T(<100).The next T lines consist of pairs of integers giving values for M and N.(M,N<=500)

Output

For each input pair, display the number of pieces that can be appropriately placed.

Example

Input: 
3
2 3
5 5
4 7
Output: 
4
13
14

Author: ankitbabbar
Date Added: 16-10-2009
Time Limit: 5 sec
Source Limit: 50000 Bytes
Languages: ADA, ASM, BASH, BF, C, C99 strict, CAML, CLOJ, CLPS, CPP 4.0.0-8, CPP 4.3.2, CS2, D, F#, FORT, GO, HASK, ICK, ICON, JAR, JAVA, JS, LISP clisp, LISP sbcl, LUA, NEM, NICE, PAS fpc, PAS gpc, PERL, PERL6, PHP, PIKE, PRLG, PYTH, PYTH 3.1.2, RUBY, SCALA, SCM guile, SCM qobi, ST, TEXT, WSPC


Comments

give me more sample inputs  

hector_rj @ 25 Oct 2009 01:14 PM

give me more sample inputs

 

Here are some sample

ankitbabbar @ 25 Oct 2009 01:18 PM

Here are some sample inputs:

18 23

10 45

27 46

23 145

give output also

hector_rj @ 25 Oct 2009 01:32 PM

give output also

i need more sample inputs &

hector_rj @ 25 Oct 2009 01:36 PM

i need more sample inputs & outputs.

 

here are the outputs for the

ankitbabbar @ 25 Oct 2009 01:44 PM

here are the outputs for the inputs mentioned before:

207

225

621

1668

if M=1 then we can place all

mohitkuldeep @ 25 Oct 2009 03:49 PM

if M=1 then we can place all pieces in N places. Am I right?

what should we print if the

ashish_v_p @ 25 Oct 2009 05:27 PM

what should we print if the values are < 0

Your program should exit for

ankitbabbar @ 25 Oct 2009 06:30 PM

Your program should exit for inputs out of the range

SUCCESSFUL SUBMISSIONS FOR THIS PROBLEM:

CodeChef is a global programming communityCodeChef hosts online programming competitions