Question 100: Output ~ The number of daffodils in 999 cases.

[Plain]
/* Start the comments in the program header (to avoid any problems encountered during the submission of blog posts, the slash used to indicate that the comments have been deleted)
* Copyright and version Declaration of the program
* All rights reserved.
* File name: txt. c
* Author: liuyongshui
* Question: Output all such numbers (100 ~ The number of daffodils in 999 cases.
* Question:
* Completion date: January 1, April 10, 2013
* Version No.: V1.0
*/
 
# Include <stdio. h>
 
Int main ()
{
Int I;
Int;
Int B;
Int c;
Int k = 0;
Int l = 0;
Int num [100];
Int cout [100];

For (I = 100; I <200; I ++)
{
A = I % 10; // obtain the single digit of num
B = I/10% 10; // obtain the ten digits of num
C = I/100; // Number of num digits
 
If (I = a * a + B * B + c * c) // check whether the number of daffodils exists.
{
Num [k ++] = I;
}
Else
{
Cout [l ++] = I;
}

}
 
Printf ("daffodils: \ n ");
For (I = 0; I <k; I ++)
{
Printf ("% d \ n", num [I]);
}

Printf ("not daffodils: \ n ");
For (I = 0; I <l; I ++)
{
Printf ("% d \ n", cout [I]);
}
 
Return 0;
}