Congruent trianglesProblem code: H3 |
All submissions for this problem are available.
After learning about congruent triangles in his recent mathematics lesson, Johnny has become very excited. He has even invented an interesting counting problem involving congruent triangles!
Recall that two triangles are congruent if their corresponding sides are equal in length and their corresponding angles are equal in size. A lattice triangle is a triangle such that the coordinates of all its vertices are integers. Johnny's problem can now be described as follows:
You are given an integer M and a lattice triangle ABC all of whose vertices (A, B, and C) are inside rectangle RM. RM is the rectangle having (0,0) as its bottom-left corner and (M,M) as its top-right corner. In other words, 0 ? xA, yA, xB, yB, xC, yC ? M. The problem is to count the number of lattice triangles congruent to ABC also having all their vertices inside the rectangle RM.
Could you help Johnny write a program to solve this problem?
Input
The first line contains t, the number of test cases (about 10). Then t test cases follow. Each test case has the following form:
- The first line contains two numbers M and K (1? M ? 1000, 1? K ?1000). K is the number of given triangles.
- Each line in the next K lines contains 6 integers xA, yA, xB, yB, xC, yC (0 ? xA, yA, xB, yB, xC, yC? M) describing a triangle ABC. It is guaranteed that ABC is always a triangle (i.e., non-degenerate).
The input for successive test cases is separated by a blank line.
Output
For each test case, output a line containing the string "Case #T:" where T should be replaced by the corresponding test case number.
Then, K lines should follow, each line containing the number of triangles having vertices inside the rectangle RM, congruent to the corresponding triangle given in the input.
Print a blank line after each test case.
Example
Input: 2 2 2 0 0 0 2 2 0 0 0 1 1 2 0 3 2 0 0 0 2 2 0 0 0 1 1 2 0 Output: Case #1: 4 8 Case #2: 16 24
Output details
The 8 triangles congruent to the second triangle (in the first test case) are presented in the following figure:
| Author: | admin |
| Date Added: | 15-09-2009 |
| Time Limit: | 1 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, LISP clisp, LISP sbcl, LUA, NEM, NICE, PAS fpc, PAS gpc, PERL, PHP, PIKE, PRLG, PYTH, PYTH 3.1.2, RUBY, SCALA, SCM guile, SCM qobi, ST, TEXT, WSPC |
Comments
SUCCESSFUL SUBMISSIONS FOR THIS PROBLEM:
Fetching successful submissions
HELP
Program should read from standard input and write to standard output. After you submit a solution you can see your results by clicking on the [My Submissions] tab on the problem page. Below are the possible results:
- Accepted
Your program ran successfully and gave a correct answer. If there is a score for the problem, this will be displayed in parenthesis next to the checkmark. - Time Limit Exceeded
Your program was compiled successfully, but it didn't stop before time limit. Try optimizing your approach. - Wrong Answer
Your program compiled and ran succesfully but the output did not match the expected output. - Runtime Error
Your code compiled and ran but encountered an error. The most common reasons are using too much memory or dividing by zero. For the specific error codes see the help section. - Compilation Error
Your code was unable to compile. When you see this icon, click on it for more information.
If you are still having problems, see a sample solution here.
well I have this doubt... Now
well I have this doubt...
Now in the given diagrams for the output of this problem, the triangles have been rotated by angles in multiples of 90 degress. Now there could be congruent lattice triangles at other rotations too. Isn't that to be considered?
Read the problem statement.
Read the problem statement. This is answered in it.