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^11).
Output
For each case, output the number of ways in one line
Sample Input
2
1
3
Sample Output
0
1
解题分析
n=ij+i+j,n+1=(i+1)(j+1),sqrt(n+1)>=(i+1),i+1<j+1,如果(n+1)%(i+1)==0,那么j久一定存在。
代码
#include<stdio.h>
int main()
{
int T;
long long int N;
scanf("%d",&T);
while(T--)
{
int ans=0;
scanf("%lld",&N);
for(long long int i=1;(i+1)*(i+1)-1<=N;i++)
{
if((N+1)%(i+1)==0)ans++;
}
printf("%d\n",ans);
}
return 0;
}