hdu 2601 An easy problem

An easy problem

Time Limit : 6000/3000ms (Java/Other)   Memory Limit : 32768/32768K (Java/Other)

Total Submission(s) : 92   Accepted Submission(s) : 35

Font: Times New Roman | Verdana | Georgia

Font Size: ← →

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

虽然在背包专题里面，但貌似并不一定要用背包，i*j+i+j=n用因式分解可以得到n+1=(i+1)*(j+1)，j>=i，那么很显然只要从根号n开始往2遍历就可以了。

#include<iostream>
#include<cmath>
using namespace std;
int main()
{
    int n;
    cin>>n;
    while(n--){
        long long int m;
        cin>>m;
        long long int m1=m+1;
        int js=0;
        long long int m2=sqrt(m1);
        for(int i=m2;i>=2;i--)
        if(m1%i==0)js++;
        cout<<js<<endl;
    }
    return 0;
}