package com.javarush.task.task20.task2025;
/*
Алгоритмы-числа
*/
public class Solution {
public static long[] getNumbers(long N) {
long[] result = null;
int S = 0;
int M = 0;
for (int i = 0; i < (int) N; i++)
{
S = i;
String so = "" + i;
char[] resu = so.toCharArray();
M = resu.length;
int Y = 0;
double L = 0.0;
for (int u = 0; u < M; u++)
{
L = Math.pow(resu[u], M);
L += L;
}
if (S == L) {result[i] = S;}
}
return result;
}
public static void main(String[] args) throws Exception {
long[] myArray = getNumbers(10000);
System.out.println(myArray.length);
}
}
package com.javarush.task.task20.task2025;
/*
Алгоритмы-числа
*/
public class Solution {
public static long[] getNumbers(long N) {
long[] result = null;
int S = 0;
int M = 0;
for (int i = 0; i < (int) N; i++)
{
S = i;
String so = "" + i;
char[] resu = so.toCharArray();
M = resu.length;
int Y = 0;
double L = 0.0;
for (int u = 0; u < M; u++)
{
L = Math.pow(resu[u], M);
L += L;
}
if (S == L) {result[i] = S;}
}
return result;
}
public static void main(String[] args) throws Exception {
long[] myArray = getNumbers(10000);
System.out.println(myArray.length);
}
}