USACO Herd Sums -- 奇因子个数

Herd Sums

Time Limit(Common/Java):1000MS/10000MS     Memory Limit:65536KByte
Total Submit: 197            Accepted: 143

Description

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分解后的数列首项为m，项数为k

分别讨论两种情况：

1.N分解为奇数个数相加，则N=(m+m+k-1) * k / 2=t * k (k为奇数)

2.N分解为偶数个数相加，则N=k / 2 * (2m+k-1)=(k / 2) * t (t=2m+k-1为奇数)

也就是说两种情况都可以把N表示为一个奇数(a)与另一个数(b)的乘积，反过来，对N的每个奇因子(a)都可以反推出上述的m和k。同时两种情况都要满足首项m为正，于是a和b之间要满足一定关系。计算后发现(这个自己可以算一算)，两个条件刚好互补！换言之，每个奇因子a刚好对应上述两种情况之一，故答案就是N的奇因子个数。