https://pintia.cn/problem-sets/994805046380707840/problems/994805084284633088
解析
题目大致意思是:给你一个 n,找到一个能被 n 整除的光棍。
光棍的定义:全为 1,例如 11、111、1111、1111111111
AC Code
public static void main(String[] args) throws Exception {
int n = nextInt();
BigInteger big = new BigInteger(n + "");
BigInteger val;
StringBuilder sb = new StringBuilder("1");
while(true) {
val = new BigInteger(sb.toString());
if(val.mod(big).compareTo(BigInteger.ZERO) == 0) break;
sb.append(1);
}
out.print(val.divide(big) + " " + sb.length());
out.flush();
}