N number, the number behind the first and, in turn, additive, and then the second, third and so on

CodePudding user response:

On the other hand, from the overall, the first number in total added only once, the second number only with two times... N number of n times, are already clear.
With the cycle count

CodePudding user response:

First write your own, and then can't post your code to ask,

CodePudding user response:

reference 1st floor Italink response:

on the other hand, from the overall, the first number in total added only once, the second number only with two times... N number of n times, are already clear.
Just use cycle count

That's right! As I've been poking fun at the other posts, on some small comrade ah, learning C language can't leave mathematics, logic aside, these should be first to use mathematical methods to find out a problem solving approach to programming to realize again, rather than a begin to traverse, circulating these stupid way, isn't botch of system resources

CodePudding user response:

I hope it can help you: https://blog.csdn.net/it_xiangqiang/category_10581430.html
I hope it can help you: https://blog.csdn.net/it_xiangqiang/category_10768339.html