Common algorithm (C #): determines whether a number is complete.

Eg: 28 = 1 + 2 + 4 + 7 + 14

That is, a number is equal to the sum of all its common dikes (except itself ).

Using system;
Using system. Collections. Generic;
Using system. text;

Namespace exiswanshu
{
Class iswanshu
{
Public bool iswanshu (INT num)
{
Int S = 0;
For (INT I = 1; I <num; I ++)
{
If (Num % I) = 0)
S = S + I;
}
If (num = s)
{
String STR = S. tostring () + "= ";
For (INT I = 1; I <s; I ++)
{
If (S % I) = 0)
{
STR = STR + "+" + I. tostring ();
}
}
Console. Write (STR + ",");
Return true;
}
Return false;
}
Static void main (string [] ARGs)
{
Iswanshu E = new iswanshu ();
Int num = convert. toint32 (console. Readline ());
Bool B = E. iswanshu (Num );
If (B)
{
Console. writeline ("{0} is the end number", num );
}
Else
{
Console. writeline ("{0} is not the final number", num );
}
}
}
}