-
Notifications
You must be signed in to change notification settings - Fork 0
/
SmartNumber.c
46 lines (41 loc) · 1.11 KB
/
SmartNumber.c
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
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
int countFactors(int n)
{
int count = 0;
for (int i = 1; i <= sqrt(n); i++)
{
if (n % i == 0)
{
if (n / i == i)
count++;
else
count = count + 2;
}
}
return count;
}
int isSmartNumber(int num)
{
int factors = countFactors(num);
if (factors % 2 == 1)
return 1;
return 0;
}
int main() {
int num;
scanf("%d", &num);
int check = isSmartNumber(num);
if (check == 1)
printf("Yes\n");
else
printf("No\n");
return 0;
}
//This program takes an integer num as input and checks if it is a smart number or not.
//The countFactors function calculates the number of factors of num.
//If the number of factors is odd, isSmartNumber returns 1 which represents that num is a smart number.
//If the number of factors is even, isSmartNumber returns 0 which represents that num is not a smart number.
//Finally, the result of isSmartNumber is printed as "Yes" if num is a smart number and "No" if it is not.