Write a passable code

Nikos Theorem

/* Verify the nikucus theorem, that is, any integer cube can be written into a string of consecutive odd numbers and. & Times; * problem analysis and Algorithm Design
This question is a theorem. Let's first prove that it is true.
For any positive integer a, whether a is an odd or even number, the integer (A & times; a-A + 1) must be an odd number.
Construct an arithmetic difference series. The first item of the series is (A & times; a-A + 1), and the difference value of the arithmetic difference series is 2 (odd number series). Then, the sum of the first item A is:
A & times; (A & times; a-A + 1) + 2 & times; a (A-1)/2 = A & times; a & times; a-A & times; a + A & times; a-A = A & times;
Theorem is true. Pass.
Through the proof of the theorem, we can see that the first entry of the odd number series required by L is (A & times; a-A + 1) and the length is. Programming algorithms do not require special design. They can be directly verified based on the proof of theorem.

OJ prompts that the memory is out of bounds. Next time, let's take a look .. Do not interrupt point recording */

# Include <stdio. h> int main (void) {int ipan [20] = {0}; int icup, ibowl, I, j; icup = ibowl = I = J = 0; scanf ("% d", & icup); ipan [0] = ibowl = (icup * icup-icup + 1); While (ibowl! = Icup * icup) {ipan [I] = ipan [I ++] + 2; ibowl + = ipan [I];} J = I + 1; I = 0; printf ("% d * % d =", icup * icup); While (I <j) {printf ("% d", ipan [I ++]); if (I! = J) putchar ('+');} return 0 ;}