C语言程序 valgrind Memory check fail ， was killed because RE是什么原因

[「已注销」]

做一个作业，是求自幂数的，
#include<stdio.h>
#include<math.h>

int check(long);//判断自幂数函数

int main(void){//主函数
int num=0;
while(num<3||num>6){
scanf("%d", &num);
}//end while

long integer=pow(10, num-1);//起始判断数值
while(integer<pow(10, num)){
if(check(integer))//调用判断函数
printf("%d\n", integer);
integer++;
}//end while

return 0;
}//end main

int check(long integer){
long sum = 0, i = integer;
int num = (int)log10(integer) + 1;//获取位数
for(int n= num; n>0; n--){
int j = i / (int)pow(10, n-1);//获取最高位数字 j
sum += pow(j, num); //幂求和
i -= j * pow(10, n-1);//减去最高位数字
}
return sum==integer? 1 : 0;//0==false 1==true
}
在服务器运行的Memory Check返回错误
Memory check fail. You might want to reproduce the errors locally with
"valgrind --leak-check=full --track-origins=yes ./a.out"
Your Program was killed by system because of TimeLimit or RE
试过时间方面应该不会超时的，但是不知道那个RE是什么来的

[FoolCarpe]

可以正常运行 输入4：

1634
8208
9474

输入5：

54748
92727
93084

[自信男孩]

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

int check(long);//判断自幂数函数
int check_self_power(int num, int n);

int main(void)
{

    int pow_val = 0, num, max;

    printf("%.0lf", pow(3, 2));
    while (pow_val < 3 || pow_val > 6)
        scanf("%d", &pow_val);


    num = pow(10, pow_val-1);
    max = pow(10, pow_val);
    while (num < max) {
        if (check_self_power(num, pow_val))
            printf("num = %d\n", num);
        num++;
    }

    /*
    int num=0;
    while(num<3||num>6){
        scanf("%d", &num);
    }//end while
    long integer = pow(10, num-1), max;
    max = pow(10, num);
    while(integer< max){
        if(check(integer))//调用判断函数
            printf("%d\n", integer);
        printf("interger = %ld\n", integer);
        integer++;
    }//end while
    */
    return 0;
}

int check(long integer)
{
    long sum = 0, i = integer;
    int num = (int)log10(integer) + 1;//获取位数
    for(int n= num; n>0; n--){
        int j = i / (int)pow(10, n-1);//获取最高位数字 j
        sum += pow(j, num); //幂求和
        i -= j * pow(10, n-1);//减去最高位数字
    }
    return sum==integer? 1 : 0;//0==false 1==true
}

int check_self_power(int num, int n)
{
    int tmp = num, sum = 0, i;

    for (i = 0; i < n; i++) {
        sum += pow(tmp % 10, n);
        tmp = tmp / 10;
    }

    return (sum == num ? 1 : 0);
}

参考一下吧 个人感觉，逻辑没必要做的太复杂

[自信男孩]

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

int check_self_power(int num, int n);

int main(void)
{

    int pow_val = 0, num, max;

    while (pow_val < 3 || pow_val > 6)
        scanf("%d", &pow_val);


    num = pow(10, pow_val-1);
    max = pow(10, pow_val);
    while (num < max) {
        if (check_self_power(num, pow_val))
            printf("num = %d\n", num);
        num++;
    }

    return 0;
}


int check_self_power(int num, int n)
{
    int tmp = num, sum = 0, i;

    for (i = 0; i < n; i++) {
        sum += pow(tmp % 10, n);
        tmp = tmp / 10;
    }

    return (sum == num ? 1 : 0);
}