Consider the following program to calculate the cyclomatic complexity:

$51$

int main$()$ int num, original Num, remainder, result$-0$ pontil "Enter a three$-$digit integer:" scanli $"$d$",$ &mum$),$ originalNum num while $($original Num $1-0)1$ remainder originalNum $\%10,$ resuit remainder remainder remainder, priginal Num $10$:

if $($result mun$)$ printf$("\%$d is an Armstrong number.", num$)$; else print $"$id is not an Armstrong number.", num$)$:

return $0$

$1$