NYOJ 216-A problem is easy

A problem is easy

时间限制： 1000 ms  |  内存限制： 65535 KB

难度： 3

描述

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 ?

输入

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

输出

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

样例输入

2
1
3

样例输出

0
1

分析：

数据大，暴力肯定超时，于是我想用开根号的方法减少循环的次数，结果依然不行，再七改八改后，wa 了十遍之后，选择了向队友求助，数学忘得一干二净的我怎么也想不起 这个公式：（i+1）（j+1）-1 = i*j+i+j ；于是公式知道了，我们就可以改变一下这个式子为：(i+1)(j+1)=n+1 ， 但我们也知道这里有两数相乘，故 i 的值肯定是不大于 根号n 的，所以就只需要一遍 for 循环即可，只要求得(n+1)%(i+1)==0，则肯定有对应的 j 的值。

#include<iostream>
#include<stdio.h>
#include<math.h>
using namespace std;

int main()
{
    int t,bj;
    long long n,m,sum;
    scanf("%d",&t);
    while(t--)
    {
        sum=0;
        bj=0;
        scanf("%lld",&n);
        m=sqrt(n+1);
        for(long long i=m;i>0;i--)
        {
           if((n+1)%(i+1)==0)
                sum++;
        }
        printf("%lld\n",sum);
    }
    return 0;
}