QOJ.ac

QOJ

Time Limit: 1.0 s Memory Limit: 256 MB Total points: 100

#17913. 烤盘

Statistics

Maggy 喜欢烘焙。她最近购买了三个已知底面积的圆形烤盘。她在前两个烤盘中烤了蛋糕,并打算把它们带到朋友家的聚会上。然而,由于携带两个烤盘非常不便,她更希望将这两个蛋糕都放入第三个烤盘中,只携带这一个烤盘。Maggy 无法确定这两个蛋糕是否装得下。此外,她需要在蛋糕之间留出一些空隙,否则蛋糕上的糖霜会混合在一起。帮 Maggy 一个忙——计算这两个蛋糕是否能一起放入第三个烤盘中。

输入格式

输入的第一行包含一个整数 $t$ — 数据组数($1 \le t \le 1000$)。

每组数据包含三个整数 $p, d, t$($1 \le p, d, t \le 8 \cdot 10^9$),两两之间用单个空格分隔,分别表示第一、第二和第三个烤盘的面积。

输出格式

对于每组数据,如果来自第一和第二烤盘的蛋糕可以一起放入第三个烤盘中,且留有非零的空隙,则输出一行,包含单词 “TAK”(波兰语中的“是”);否则输出 “NIE”(波兰语中的“否”)。

样例

输入样例 1

3
3 9 25
4 9 25
5 9 25

输出样例 1

TAK
NIE
NIE

Discussions

About Discussions

The discussion section is only for posting: General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.

This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.

Open Discussions 0
No discussions in this category.

Issues

About Issues

If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.

Guidelines:

  1. This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
  2. Do not submit duplicated issues.
  3. Issues must be filed in English or Chinese only.
Active Issues 0
No issues in this category.
Closed/Resolved Issues 0
No issues in this category.