只需从交换方法A更改为交换方法B,UVa法官就会从“错误答案”变为“已接受”。这是为什么?我预先感谢大家的答复。
import java.io.IOException;
import java.util.StringTokenizer;
/**
* @author Coder47
* Another solution to 3n+1 (UVa ID: 100)
*/
class Main {
public static int[] cache = new int[1000000];
static String ReadLn (int maxLg) // utility function to read from stdin
{
byte lin[] = new byte [maxLg];
int lg = 0, car = -1;
try
{
while (lg < maxLg)
{
car = System.in.read();
if ((car < 0) || (car == '\n')) break;
lin [lg++] += car;
}
}
catch (IOException e)
{
return (null);
}
if ((car < 0) && (lg == 0)) return (null); // eof
return (new String (lin, 0, lg));
}
public static void main(String[] args) {
Main myWork = new Main(); // create a dynamic instance
myWork.Begin(); // the true entry point
}
void Begin() {
String input;
StringTokenizer idata;
// corresponds to swap method A
int a, b, temp, cycle, cycleMax;
// corresponds to swap method B
// int a, b, min, max, cycle, cycleMax;
while ((input = Main.ReadLn(255)) != null)
{
idata = new StringTokenizer(input);
a = Integer.parseInt(idata.nextToken());
b = Integer.parseInt(idata.nextToken());
// swap method A
if (b < a) {
temp = a;
a = b;
b = temp;
}
// swap method B
// min = Math.min(a, b);
// max = Math.max(a, b);
cycleMax = 0;
// corresponds to swap method A
for (int i = a; i <= b; i++)
// corresponds to swap method B
// for ( int i = min; i <= max; i++)
{
cycle = calculateCycle(i);
if (cycle > cycleMax) {
cycleMax = cycle;
}
}
System.out.println (a + " " + b + " " + cycleMax);
}
}
public int calculateCycle(int n) {
return calculateCycleHelper(n, 1);
}
public int calculateCycleHelper(int n, int cycleNum) {
if (n == 1) {
return cycleNum;
} else {
return calculateCycleHelper(next(n), cycleNum + 1);
}
}
public int next(int n) {
if (n % 2 == 0) {
n = n/2;
}
else {
n = 3*n+1;
}
return n;
}
}
请忽略代码的效率和其他相关问题,因为这不是这里的问题。
最佳答案
这是因为if (a < b)
与您想要的相反。如果b < a
,则需要交换元素,因为在for循环中
for (int i = a; i <= b; i++)
您希望
a
小于b
。编辑
对于您更新的问题,答案是因为法官正在检查输出。如果交换
a
和b
该行的输出 System.out.println (a + " " + b + " " + cycleMax);
更改,因此法官不接受。
关于java - 为什么对于UVa在线法官100(3n + 1),方法A与B相比有缺陷?,我们在Stack Overflow上找到一个类似的问题:https://stackoverflow.com/questions/34009705/