LanQiaoTestCodes/求阶乘.java

41 lines
700 B
Java
Raw Normal View History

2023-04-23 12:30:47 +00:00
package LanQiaoOJ;
import java.math.BigInteger;
import java.util.Scanner;
/*
* <EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
<EFBFBD><EFBFBD><EFBFBD><EFBFBD>N!<EFBFBD><EFBFBD>ĩβǡ<EFBFBD><EFBFBD><EFBFBD><EFBFBD>K<EFBFBD><EFBFBD>0<EFBFBD><EFBFBD><EFBFBD><EFBFBD>С<EFBFBD><EFBFBD>N<EFBFBD>Ƕ<EFBFBD>
<EFBFBD>٣<EFBFBD>
<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>N<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>һ1<EFBFBD><EFBFBD>
<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ʽ
һ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>K<EFBFBD><EFBFBD>
<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ʽ
һ<EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>𰸡<EFBFBD>*/
public class <EFBFBD><EFBFBD><EFBFBD>׳<EFBFBD> {
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
long k=sc.nextInt();//0<>ĸ<EFBFBD><C4B8><EFBFBD>
for(long i=2;i<1e18;i++) {
if(Fun(i)==k) {
System.out.print(i);
break;
}else if(Fun(i)>k) {
System.out.print(-1);
return;
}
}
}
public static long Fun(long n) {
long ans=0;
while(n>0) {
//<2F><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>1<EFBFBD><31>5<EFBFBD><35><EFBFBD><EFBFBD>1<EFBFBD><31>0<EFBFBD><30><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>5<EFBFBD>ĸ<EFBFBD><C4B8><EFBFBD>
ans=ans+n/5;
n=n/5;
}
return ans;
}
}