Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- class Task26 {
- static public int numLength(int x) {
- if (x == 0) {
- return 1;
- }
- int counter = 0;
- while (x >0) {
- counter++;
- x /= 10;
- }
- return counter;
- }
- static public int[] numInArray(int x) {
- int[] a = new int[numLength(x)];
- if (x == 0) {
- a[0] = 0;
- return a;
- }
- int counter = 0;
- while (x > 0) {
- a[counter] = x % 10;
- x /= 10;
- counter++;
- }
- return a;
- }
- static public boolean isArmstrongNum(int x) {
- int[] a = numInArray(x);
- int sum = 0;
- for (int i = 0; i < a.length; ++i) {
- sum += a[i];
- }
- int ans = sum;
- for (int i = 2; i <= a.length; ++i) {
- ans *= sum;
- }
- if (ans == x) {
- return true;
- }
- return false;
- }
- static public ArrayList<Integer> armstorngNums(int k) {
- ArrayList<Integer> a = new ArrayList<Integer>();
- for (int i = 1; i <= k; ++i) {
- if (isArmstrongNum(i)) {
- a.add(i);
- }
- }
- return a;
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement