Iloczyn [B] - 問題

#6072. Iloczyn [B]

統計

この問題は以下のコンテストで使用されています：

Potyczki Algorytmiczne 2013, Runda 4

给定一个正整数 $n$，判断其是否可以将其表示为 $k$ 个不同的正整数的乘积。

输入格式

输入的第一行包含一个整数 $t$ ($1 \le t \le 4\,000$)，表示要考虑的测试用例的数量。接下来的 $t$ 行中的每一行包含两个整数 $n_{i}$ 和 $k_{i}$ ($1 \le n_{i} \le 10^{9}$，$1 \le k_{i} \le 20$)。

输出格式

你的程序应该输出恰好 $t$ 行。这些行中的第 $i$ 行应该包含一个单词 TAK 或 NIE，取决于数字 $n_{i}$ 是否可以表示为 $k_{i}$ 个不同因子的乘积。

示例

输入

输出

TAK
TAK
NIE

About Issues

We understand that our problem archive is not perfect. If you find any issues with the problem, including the statement, scoring configuration, time/memory limits, test cases, etc.

You may use this form to submit an issue regarding the problem. A problem moderator will review your issue and proceed it properly.

STOP! Before you submit an issue, please READ the following guidelines:

This is not a place to publish a discussion, editorial, or requests to debug your code. Your issue will only be visible by you and problem moderators. Other users will not be able to view or reply your issues.
Do not submit duplicated issues. If you have already submitted one, please wait for an moderator to review it. Submitting multiple issues will not speed up the review process and might cause your account to be banned.
Issues must be filed in English or Chinese only.
Be sure your issue is related to this problem. If you need to submit an issue regarding another problem, contest, category, etc., you should submit it to the corresponding page.

Active Issues 0

No issues in this category.

Closed/Resolved Issues 0