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

Two Mirrors

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


Problem 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
 

Hint

Hints: Maybe Kth Nomad is reflected by one mirror but you see Nomad in another mirror, then you should print "You can't see me!" (No quote).
 

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-11-26 09:15:46, Gzip enabled