1091 N-自洽（JAVA）
最编程
2024-03-17 18:57:47
...
import java.io.*;
/**
* @author yx
* @date 2022-07-26 20:46
*/
public class Main {
static PrintWriter out=new PrintWriter(System.out);
static BufferedReader ins=new BufferedReader(new InputStreamReader(System.in));
static StreamTokenizer in=new StreamTokenizer(ins);
public static void main(String[] args) throws IOException {
in.nextToken();
int M=(int) in.nval;
for (int i = 0; i < M; i++) {
in.nextToken();
int m=(int) in.nval;
int k=(m+"").length();
boolean flag=false;
for (int j = 1; j < 10; j++) {
if(j*m*m%Math.pow(10,k)==m){
System.out.println(j+" "+j*m*m);
flag=true;
break;
}
}
if(!flag){
System.out.println("No");
}
}
}
}
上一篇： 自守数 C 语言算法