Disarium Number (Special Numbers Series #3)

zltzlt

Definition

Disarium number is the number that The sum of its digits powered with their respective positions is equal to the number itself.

Task

Given a number, Find if it is Disarium or not .

1. #include <string>
   
2. #include <cmath>
   
3. 
   
4. using namespace std;
   
5. 
   
6. string int2str(int n)
   
7. {
   
8.     int m = n;
   
9.     char s[100];
   
10.     char ss[100];
    
11.     int i = 0, j = 0;
    
12.     if (n < 0)
    
13.     {
    
14.         m = 0 - m;
    
15.         j = 1;
    
16.         ss[0] = '-';
    
17.     }
    
18.     while (m > 0)
    
19.     {
    
20.         s[i++] = m % 10 + '0';
    
21.         m /= 10;
    
22.     }
    
23.     s[i] = '\0';
    
24.     i = i - 1;
    
25.     while (i >= 0)
    
26.     {
    
27.         ss[j++] = s[i--];
    
28.     }
    
29.     ss[j] = '\0';
    
30.     string res = ss;
    
31.     return res;
    
32. }
    
33. 
    
34. int char2int(char ch)
    
35. {
    
36.     switch (ch)
    
37.     {
    
38.         case '0': return 0; break;
    
39.         case '1': return 1; break;
    
40.         case '2': return 2; break;
    
41.         case '3': return 3; break;
    
42.         case '4': return 4; break;
    
43.         case '5': return 5; break;
    
44.         case '6': return 6; break;
    
45.         case '7': return 7; break;
    
46.         case '8': return 8; break;
    
47.         case '9': return 9; break;
    
48.     }
    
49. }
    
50. 
    
51. string disariumNumber (int number )
    
52. {
    
53.     string res = int2str(number);
    
54.     int n = 0;
    
55.     for (int i = 1; i <= res.size(); i++) {
    
56.         n += pow(char2int(res[i - 1]), i);
    
57.     }
    
58.     if (n == number) return "Disarium !!";
    
59.     return "Not !!";
    
60. }

复制代码