Herd Sums (数学)

The cows in farmer John's herd are numbered and branded with consecutive integers from 1 to N (1 <= N <= 10,000,000). When the cows come to the barn for milking, they always come in sequential order from 1 to N.

Farmer John, who majored in mathematics in college and loves numbers, often looks for patterns. He has noticed that when he has exactly 15 cows in his herd, there are precisely four ways that the numbers on any set of one or more consecutive cows can add up to 15 (the same as the total number of cows). They are: 15, 7+8, 4+5+6, and 1+2+3+4+5.

When the number of cows in the herd is 10, the number of ways he can sum consecutive cows and get 10 drops to 2: namely 1+2+3+4 and 10.

Write a program that will compute the number of ways farmer John can sum the numbers on consecutive cows to equal N. Do not use precomputation to solve this problem.

Input

* Line 1: A single integer: N

Output

* Line 1: A single integer that is the number of ways consecutive cow brands can sum to N.

Sample Input

15

Sample Output

4

题意：所有连续数的和为n的方案数。

等差数列求和公式的运用。

问n=a+a+1+a+2+…+a+k 的情况总数

n=(k+1)*a+(k+1)*k/2

=(k+1)(a+k/2)

n为整数，k+1为整数，(a+k/2)为整数，k为偶数，k+1为奇数

当n和k+1确定时，a为定值

故解为n的奇因子个数

#include <iostream>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <string>
#include <queue>
#include <cmath>

using namespace std;

int main()
{
    int n,ans=0;
   scanf("%d",&n);
   n=n*2;
   int len=sqrt((double)n);//范围缩小
   for(int i=1;i<=len;i++){
    if(n%i==0&&(n/i)%2!=(i%2)){//求所有是n的因子i，并且i是奇数
        ans++;
    }
   }
   printf("%d\n",ans);
    return 0;
}