hdoj 2601 An easy problem

An easy problem

Time Limit: 6000/3000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 7591    Accepted Submission(s): 1802

Problem Description

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¹⁰).

Output

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

Sample Input

2
1
3

Sample Output

0
1

暴力过：

 

n = i * j + i + j = ( i + 1) * ( j + 1 ) - 1

 

因为题目限制 i < j，所以可将此题转化成求 n+1 的 总因子数 sum（除去1和自身），再sum / 2。

方法：用普通判断素数的方法就可以过。 

 

#include<stdio.h>
#include<math.h>
int main()
{
    int t;
    __int64 n,i,j,sum;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%I64d",&n);
        n++;
        sum=0;
        j=sqrt(n);
        for(i=2;i<=j;i++)
        {
            if(n%i==0)
            sum++;
        }
        printf("%I64d\n",sum);
    }
    return 0;
}