poj2140(1Y)

http://poj.org/problem?id=2140

Herd Sums

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 13436		Accepted: 8016

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

Source

USACO 2003 March Orange

题意：很清楚求一个n数可以分成多少个<=n的连续的数相加得到。。如10可以分成10和1+2+3+4共2种可能

15可以分成 15, 7+8, 4+5+6, and 1+2+3+4+5. 一开始我担心会不会超时但是居然

164K

250MS

C++

311B

时间复杂度还不大会求。。

代码如下：

• Source Code

  #include<stdio.h>
  int main()
  {
          int n;
          while(scanf("%d",&n)!=EOF)
          {
                  int i,j;
                  int count=0;
                  int sum;
                  for(i=1;i<=n;i++)
                  {
                          sum=0;
                          for(j=i;j<=n;j++)
                          {
                                  sum+=j;
                                  if(sum==n)
                                          count++;
                                  else if(sum>n)
                                          break;
                          }
                  }
                  printf("%d\n",count);
          }
          return 0;
  }