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

思路：

 设m=i*j+i+j;

 变形即为：m+1=(i+1)*(j+1)

 只需满足  (m+1)%(i+1)==0即可。

 且i的范围可以限制在1~sqrt(m+1)中；

#include <iostream>
//#include <vector>
//#include <algorithm>
//#include <iterator>
//#include <stdio.h>
//#include <limits.h>
#include <cmath>
using namespace std;

int main() {
    int n;
    cin>>n;
    while(n--){
        int m;
        cin>>m;
        int k=0;
        int t=sqrt(m+1);
        for(int i=2;i<=t;i++){
            if((m+1)%i==0)
                k++;
        }

        cout<<k<<endl;
    }
return 0;
}