Two Mirrors

Time Limit: 1000ms
Memory Limit: 32768KB
This problem will be judged on HDU. Original ID: 3025
64-bit integer IO format: %I64d      Java class name: Main

Description

Nomad wants to know why girls like using mirrors. So he bought one, but it's not a normal one. The mirror is made up of two normal mirrors, which are connected at a point (x2, y2). So it is said, two mirrors can be described as two line segment. (x1, y1) (x2, y2) and (x2, y2) (x3, y3). And Nomad is at the point (x0, y0). And he is amazing to see that there are many Nomads in the special mirror. The Kth Nomad is described as the picture below. (Mirror face is always on the side of the smaller angle, and three point of mirror are never in a line.)

The first Nomad is the image of Nomad
The second Nomad is the image of the first Nomad
The third Nomad is the image of the second Nomad
And continue to Kth Nomad~

The first Nomad is always in mirror(x1,y1)(x2,y2);
The second Nomad is always in mirror(x2,y2)(x3,y3);
The third Nomad is always in mirror(x1,y1)(x2,y2);
The 4th Nomad is always in mirror(x2,y2)(x3,y3);
And continue to Kth Nomad~

Input

There are multiple cases. For each test case, Nine numbers, x0, y0, x1, y1, x2, y2, x3, y3 and a integer K.(1 ≤ K ≤ 1000)

Output

If you can see Kth Nomad ,print a point x, y (accurate up to 4 decimal places.) where Kth Nomad is, or print "You can't see me!"(No quote).

Sample Input

0.0 0.0
-4.0 0
0.0 20.0
4.0 0
1
0.0 0.0
-4.0 0
0.0 20.0
4.0 0
2

Sample Output

-7.6923 1.5385
14.2012 5.9172

Source

Language: 
Theme: 
Share Code? 

Powered by NB231 | Current Style: .