Help me in solving LPYAS151 problem

My issue

hidden case failed

My code

#include <stdio.h>
#include <math.h>
int main() {
    int num, temp, originalNum, remainder, sum = 0, n = 0; 

    printf("Input a number: ");
    scanf("%d", &num);

    originalNum = num;

    for (temp = num; temp != 0; n++) {
        temp /= 10;
    }

    for (temp = num; temp != 0; temp /= 10) {
        remainder = temp % 10;
        sum += pow(remainder, n);
    }

    if (sum == originalNum) {
        printf("Armstrong\n", originalNum);
    } else {
        printf("not Armstrong\n", originalNum);
    }
    return 0;
} 


Learning course: Algorithmic Problem Solving
Problem Link: https://www.codechef.com/learn/course/klu-problem-solving/KLUPS00A/problems/LPYAS151

#include <stdio.h>
#include <math.h>

int main() {
    int num, originalNum,sum=0,count=0;

    printf("Enter an integer: ");
    scanf("%d", &num);
    
    originalNum= num;
    while (originalNum != 0) {
        originalNum /= 10;
        count++;
    }
    
    originalNum= num;
    while (originalNum != 0) {
        int rem = originalNum % 10;
        sum = sum + pow(rem, count);
        originalNum = originalNum /10;
    }
    
    if (sum == num) {
        printf("%d is an Armstrong number.\n", num);
    } else {
        printf("%d is not an Armstrong number.\n", num);
    }

    return 0;
}

here the code is