-
Notifications
You must be signed in to change notification settings - Fork 0
/
armstrong_number.cpp
60 lines (54 loc) · 1.16 KB
/
armstrong_number.cpp
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
/*
* =====================================================================================
*
* Filename: armstrong_number.cpp
*
* Description: 1134. Armstrong Number
*
* Version: 1.0
* Created: 06/09/2024 10:32:21
* Revision: none
* Compiler: gcc
*
* Author: [email protected]
* Organization:
*
* =====================================================================================
*/
#include <cmath>
#include <initializer_list>
#include <utility>
#include "gmock/gmock.h"
#include "gtest/gtest.h"
using std::initializer_list;
using std::pair;
class Solution {
public:
bool isArmstrong(int n) {
int m = n;
int k = 0;
while (m > 0) {
k++;
m /= 10;
}
int sum = 0;
m = n;
while (m > 0) {
sum += std::pow(m % 10, k);
if (sum > n) {
return false;
}
m /= 10;
}
return (sum == n);
}
};
TEST(Solution, isArmstrong) {
initializer_list<pair<int, bool>> cases = {
std::make_pair(153, true),
std::make_pair(123, false),
};
for (const auto& c : cases) {
EXPECT_EQ(Solution().isArmstrong(c.first), c.second);
}
}