project1/advancedClassificationLoop.c at main · sivan0987/project1 · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
#include <stdio.h>
#include <math.h>
#include "NumClass.h"

int reverse(int n){
     int  a = 0;
     int r;
    while (n != 0)
    {
        r = n % 10;
        a = a * 10 + r;
        n /= 10;
    }
    return a;
}
int dig(int num)
{
int  digits = 0;
            while(num != 0)
            {
                num/=10;
                digits++;
            }
            return digits;
}

int isArmstrong1(int num,int sum,int n)
{
if(num<10)
return sum+pow(num,n);
else
{
    sum=sum+(pow((num%10),n));
    num=num/10;
    return isArmstrong1(num,sum,n);
}
}

int isArmstrong(int num)
{
int n=dig(num);
int sumArm=isArmstrong1(num,0,n);
if(sumArm==num)
return 1;
return 0;
}

int isPalindrome1(int x, int num){

    if(x%10!=num%10)
            return 0;
    if(x==0 && num==0)
        return 1;
    return isPalindrome1(x/10 , num/10);
}
int isPalindrome(int x){
    int num=reverse(x);
    return isPalindrome1(x,num);

}