QOJ.ac

QOJ

Time Limit: 1.0 s Memory Limit: 128 MB Total points: 100 Hackable ✓

#9248. 簡単な数学の問題

統計

整数 $n$ が与えられる。$pq \mid n$ を満たす $p \le q$ に対して、$r = \frac{p}{q}$ とおく。$r$ として取り得る値の個数を求めよ。

入力

入力の最初の行にはテストケースの数 $q$ ($1 \le q \le 2000$) が含まれる。続く $q$ 行のそれぞれには、整数 $n$ ($1 \le n \le 10^{10}$) が含まれる。

出力

各テストケースについて、$r$ の異なる値の個数を1行で出力せよ。

入出力例

入力 1

10
1
2
3
4
5
6
7
8
9
10

出力 1

1
2
2
3
2
5
2
4
3
5

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.