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

画图游戏

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


Problem Description
forever97和pikapikachu在玩一种画图游戏,两人相互往一个n*m大的矩形里画半径为r的圆,任意两圆不能相交,圆与矩形也不能相交,不能再画的人输。现在forever97先画,假设两人都足够聪明,均采取最佳策略,问最后谁会赢?
 

Input
第一行一个正整数T(T<=100),表示共有T组数据。
对于每组数据,一行三个正整数n,m,r(1<=n,m,r<=10000)。
 

Output
对每组数据输出一行,即最后的赢家。
 

Sample Input
2 2 2 1 1 1 1
 

Sample Output
forever97. pikapikachu>.<
 

Source
 

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