[蓝桥杯][2017年第八届真题]小计算器 （java），官网测试只有三十分，待修改

看了好多关于这个题的答案，java版本的一个都不对，都是零分，，C++版的倒是满分，可是我看着想法与我写的java基本一样，不清楚我错在了哪里。

不多说看代码吧

import java.util.Scanner;
import java.util.List;
import java.util.ArrayList;

public class Main {
	static List<String> ress = new ArrayList<>();
	static long res = 0;
	static int opt[] = new int[]{0,10};
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int n = Integer.parseInt(in.nextLine());
		for(int i = 0;i < n; ++i) {
			String[] act = in.nextLine().split(" ");
			check(act);
		}
		for(String r:ress) {
			System.out.println(r);
		}
		in.close();
	}
	static void check(String[] act) {
		switch(act[0]) {
			case "CLEAR":{
				ress.clear();
				res = 0;
				opt[0] = 0;
				break;
			}
			case "ADD": opt[0] = 1;break;
			case "SUB": opt[0] = 2;break;
			case "MUL": opt[0] = 3;break;
			case "DIV": opt[0] = 4;break;
			case "MOD": opt[0] = 5;break;
			case "CHANGE": {
				opt[1] = Integer.parseInt(act[1]);
				break;
			}
			case "NUM":{
				long valTenJinzhi = Long.parseLong(act[1],opt[1]);
				switch(opt[0]) {
					case 0:res = valTenJinzhi;break;
					case 1:res += valTenJinzhi;break;
					case 2:res -= valTenJinzhi;break;
					case 3:res *= valTenJinzhi;break;
					case 4:res /= valTenJinzhi;break;
					case 5:res %= valTenJinzhi;break;
				}
				opt[0] = 0;
				break;
			}
			case "EQUAL":{
				ress.add(changeOtherJinzhi(res));
				break;
			}
		}
	}
	static String changeOtherJinzhi(long valTenJinzhi) {
		int jinzhi = opt[1];
		String strOut = "";
		while(valTenJinzhi != 0) {
			long remTenJinzhi = valTenJinzhi % jinzhi;
			if(remTenJinzhi < 10) {
				strOut = String.valueOf(remTenJinzhi) + strOut;
			}else {
				strOut = (char)(remTenJinzhi-10+'A') + strOut;
			}
			valTenJinzhi = valTenJinzhi / jinzhi;
		}
		return strOut.toUpperCase();
	}
}

下边是我看的C++版本，，满分通过的

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<ctype.h>
typedef long long LL;
LL GOD;
int require,base;
LL transform(char *num)
{
	int i;
	LL sum=0,nowbase=1;
	for(i=strlen(num)-1;i>=0;i--)
	{
		if(isdigit(num[i]))
			sum+=(num[i]-'0')*nowbase;
		else
			sum+=(num[i]-'A'+10)*nowbase;
		nowbase*=base;
	}
	return sum;
}
int notransform(char *num)
{
	int sp=0;
	sscanf(num,"%d",&sp);
	return sp;
}
char* retransform(LL num)
{
	static char ans[100]={0};
	int index=1;
	if(!num)
		ans[index++]='0';
	while(num)
	{
		int temp=(num%base);
		if(temp<10)
			ans[index++]=temp+'0';
		else
			ans[index++]=temp-10+'A';
		num/=base;
	}
	ans[0]=index-1;
	return ans;
}
void runorder(char *str)
{
	char Torder[9][10]={"NUM","ADD","SUB","MUL","DIV","MOD","CHANGE","EQUAL","CLEAR"};
	char sp[10];
	sscanf(str,"%s",sp);
	char spnum[100]={0};
	if(strlen(sp)!=strlen(str))
		sscanf(str,"%*s%s",spnum);
	int i,j;
	char *temp=NULL;
	for(i=0;i<9;i++)
	{
		if(!strcmp(sp,Torder[i]))
		{
			switch(i)
			{
				case 0:
					if(require==0)
						GOD=transform(spnum);
					else
					{
						if(require==1)
							GOD+=transform(spnum);
						if(require==2)
							GOD-=transform(spnum);
						if(require==3)	
							GOD*=transform(spnum);
						if(require==4)	
							GOD/=transform(spnum);
						if(require==5)	
							GOD%=transform(spnum);
						require=0;
					}
					break;
				case 1:
					require=1;break;
				case 2:
					require=2;break;
				case 3:
					require=3;break;
				case 4:
					require=4;break;
				case 5:
					require=5;break;
				case 6:
					base=notransform(spnum);break;
				case 7:	
					temp=retransform(GOD);
					for(j=temp[0];j>=1;j--)
						putchar(temp[j]);
					putchar('\n');
					break;
				case 8:
					GOD=0;
					require=0;
			}
		}
	}
}
int main(int argc,char **argv)
{
	int cnt;
	scanf("%d",&cnt);
	base=10,require=0;
	while(cnt--)
	{
		char order[30];
		scanf("%*c%[^\n]",order);
		runorder(order);
	}
	return EXIT_SUCCESS;
}