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

两个for循环会超时根据公式有  i*j+i+j=n 推出  i*j+i+j+1=n+1   (i+1)*(j+1)=(n+1)  可知  i 从2循环到sqrt(n+1)即可

   

01. #include<iostream>

02. #include<cmath>

03. using namespace std;

04. int main()

05. {

06. int T;

07. cin>>T;

08. while(T--)

09. {

10. int N,sum=0;

11. cin>>N;

12. for(int i=2;i<=sqrt(N+1);i++)

13. {

14. if((N+1)%i==0)

15. sum++;

16. }

17. cout<<sum<<endl;

18. }

19. return 0;

20. }