-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathbasicClassification.c
More file actions
53 lines (44 loc) · 846 Bytes
/
Copy pathbasicClassification.c
File metadata and controls
53 lines (44 loc) · 846 Bytes
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
#include<stdio.h>
#include "NumClass.h"
int isPrime(int num){
if (num==1 || num==2)
return TRUE;
int ans = TRUE;
for(int i=2 ; i< num ;i++){
if(num%i==0)
ans=FALSE;
}
return ans;
}
int factorial(int num){
int ans=1;
for(int i=1; i<=num; i++){
ans*=i;
}
return ans;
}
int isStrong(int num){
int sum=0;
int originalNum =num;
while(num>0){
int digit= num%10;
int factNum = factorial(digit);
sum+=factNum;
num/=10;
}
if(sum==originalNum){
return TRUE;
}
return FALSE;
}
// #include<stdio.h>
// #include "NumClass.h"
// void main(){
// int x = 71;
// int y = 145;
// if(isStrong(y)==1){
// printf("%d ,strong",y);
// }else{
// printf("%d ,not strong",y);
// }
// }