贝壳笔试渣渣题解
只会暴力，a了2.36
傻傻的搏斗
100%
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int X,A,C,Y,B,D;
int t=sc.nextInt();
while(t--!=0) {
X=sc.nextInt();
A=sc.nextInt();
C=sc.nextInt();
Y=sc.nextInt();
B=sc.nextInt();
D=sc.nextInt();
int time1;
int time2;
if(Y<=A)
time1=0;
else if(Y%A==0)
time1=((Y/A)-1)*C;
else
time1=(Y/A)*C;
if(X<=B)
time2=0;
else if(X%B==0)
time2=((X/B)-1)*D;
else
time2=(X/B)*D;
if(time1>time2){
System.out.println("XIAOCHUN");
}
else if(time1<time2) {
System.out.println("XIAOZHI");
}
else
System.out.println("TIP");
}
}
}
简单的表达式计算
100%
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String s = sc.nextLine();
int sum=0;
char[] input = s.toCharArray();
int index = 0;
StringBuffer sb = new StringBuffer();
for(;index<input.length && input[index]!='+'&& input[index]!='-';index++) {
sb.append(input[index]);
}
if(sb.charAt(0)=='0' && sb.charAt(1)=='x')
sum+=Integer.parseInt(sb.toString().substring(2), 16);
else if(sb.charAt(0)=='0')
sum+=Integer.parseInt(sb.toString(), 8);
else
sum+=Integer.parseInt(sb.toString());
for(int i=index+1;i<input.length;i++) {
sb = new StringBuffer();
while(i<input.length && input[i]!='+' && input[i]!='-') {
sb.append(input[i]);
i++;
}
if(input[index]=='+') {
if(sb.charAt(0)=='0' && sb.charAt(1)=='x')
sum+=Integer.parseInt(sb.toString().substring(2), 16);
else if(sb.charAt(0)=='0')
sum+=Integer.parseInt(sb.toString(), 8);
else
sum+=Integer.parseInt(sb.toString());
}
else {
if(sb.charAt(0)=='0' && sb.charAt(1)=='x')
sum-=Integer.parseInt(sb.toString().substring(2), 16);
else if(sb.charAt(0)=='0')
sum-=Integer.parseInt(sb.toString(), 8);
else
sum-=Integer.parseInt(sb.toString());
}
index=i;
}
System.out.println(sum);
}
}
--------------------------------------------------------------------------------------
找寻序列
36%
package fs.object; import java.util.Scanner;
public class Main {
static int result = 0;
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
int M = sc.nextInt();
func(0,N,M,1);
System.out.println(result);
}
public static void func(int n,int N,int M,int preA) {
if(n==N) {
if(preA==M)
result++;
return ;
}
for(int i=1;i<=M;i++) {
if(i%preA==0)
func(n+1,N,M,i);
}
}
}
#贝壳找房##题解##笔试题目#
