1.计算糖果
import java.util.*;
//自己换成Main函数
public class DAY4 {
/**
* 计算糖果
* @param args
*/
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int a = sc.nextInt();
int b = sc.nextInt();
int c = sc.nextInt();
int d = sc.nextInt();
//由题设可知等式
int A = (a+c)/2;
int B1 = (c-a)/2;
int B2 = (b + d)/2;
int C = (d-b)/2;
//若B1=B2 则成立
if(B1 != B2){
System.out.println("No");
}else {
System.out.print(A + " "+ B2 +" " +C);
}
}
2.进制转换
import java.util.*;
public class Main{
/**
* 进制转换
* N进制数:每个进制位的值分别X0*N^0 x1*N^1,x2*N^2...,x1,x2,x3 就是这些进制位的值,
* 即进行取模余数就是当前进制的值,再通过/10 进入下一个进制位的计算
*/
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int m = sc.nextInt();
int n = sc.nextInt();
//s返回字符串方便拼接
StringBuilder s = new StringBuilder();
//对照表 eg :123
String table = "0123456789ABCDEF";
//标志位判断是否为负数
boolean flg = false;
if(m < 0){
m = -m;
flg = true;
}
//边界条件判断
if(m ==0){
System.out.println(0);
}
//得到当前进制的值 3 2 1
while(m != 0){
s.append(table.charAt(m%n));
m = m/n;
}
//若为负数 则最后加- 3 2 1 -
if(flg){
s.append("-");
}
//反转字符串
s.reverse();
System.out.println(s);
}
}