#include <iostream>
using namespace std;
int CountN(int number);
int main()
{
int m=5;
int count_n=CountN(m);
system("pause");
return 0;
}
int CountN(int number)
{
int number1=1;
int number2=2;
int cnt=0;
int temp=number2+number1;
while(1)
{
if (number1>=(number+1)/2)
{
break;
}
if (temp<number)
{
number2++;
temp=temp+number2;
}
else if(temp>number)
{
temp=temp-number1;
number1++;
}
else
{
cnt++;
number2++;
temp=temp+number2;
}
}
return cnt;
}
和为n连续正数序列
最新推荐文章于 2020-12-07 18:27:11 发布