B - An easy problem

B - An easy problem

Crawling in process... Crawling failed Time Limit:3000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u

Submit Status

Description

Input

Output

Sample Input

Sample Output

Hint

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

#include <stdio.h>
#include <math.h>
int main()
{
 int T;
 int  i,j;
 long long n;
 scanf("%d",&T);
 while(T--)
 {
  scanf("%lld",&n);
  int s = 0;
  int k = (int)sqrt(n+1);
  for(i = 2; i <= k; ++i)
  {
   if((n+1) % i == 0)
   s++;
  }
  printf("%d\n",s);
 }
}

简单的变换思路的问题，把i*j+i+j=N；通过加法变成（i+1）*（j+1）=N-1的问题，其中因为i与j近似，所以通过此将原本超时的两层循环改成一层循环；

其中int k=(int )sqrt(N)就是对程序的一种优化，大大减少了时间复杂度。