Nyoj 216 A problem is easy "math problem"

Just a little bit of simplicity.

A problem is easy time limit: +Ms | Memory Limit:65535KB Difficulty:3

Describe

When Teddy is a child, he is always thinking on some simple math problems, such as "what it ' s 1 cup of water plus 1 Pile of dough., "Yuan buy pig". etc..

One day Teddy met a-a-man-in-his-dream, in-Dream the man whose name is "Rulai" gave Teddy a problem:

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

Teddy found the answer when N is less than 10...but if n get bigger, he found it is too difficult for him to solve.
Well, are you clever acmers, could do I little Teddy to solve the problem and let him has a good dream?

Input

The first line contain a T (T <=). 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

213

Sample output

01

Uploaded by

Miao-dong building

#include <stdio.h>int main () {int i,j,s,m,sum;scanf ("%d", &s), while (s--) {sum=0;scanf ("%d", &m), and for (I=1 ;(i+1) * (i+1) -1<=m;i++) {if ((m+1)% (i+1) ==0) sum++;} printf ("%d\n", sum);} return 0;}

Nyoj 216 A problem is easy math problem