题目详情 - Aproblemiseasy - 南阳理工学院OJ

ID: 313

远端评测题

1000ms

128MiB

尝试: 0

已通过: 0

难度: (无)

上传者:

Hydro

When Teddy was a child , he was always thinking about some simple math problems ,such as “What it’s 1 cup of water plus 1 pile of dough ..” , “100 yuan buy 100 pig” .etc..

One day Teddy met a old man in his dream , in that dream the man whose name was“RuLai” gave Teddy a problem :

Given an N , can you calculate how many ways to write N as i * j + i + j (0 < i <= j) ?

Teddy found the answer when N was less than 10…but if N get bigger , he found it was too difficult for him to solve.
Well , you clever ACMers ,could you help little Teddy to solve this problem and let him have a good dream ?

Input

The first line contain a T(T <= 2000) . followed by T lines ,each line contain an integer N (0<=N <= 10^11).

Output

For each case, output the number of ways in one line

Sample Input

2
1
3

Sample Output

0
1

HINT

Source

NYOJ

#P1312. Aproblemiseasy

Aproblemiseasy

Input

Output

Sample Input

Sample Output

HINT

Source

统计

状态

开发

支持

#P1312. Aproblemiseasy

Aproblemiseasy

Input

Output

Sample Input

Sample Output

HINT

Source

统计

状态

开发

支持

还没有账户？

登录