1 Star 0 Fork 0

besti1923/加-小妹-v.x(20192304)获取-代-码

加入 Gitee
与超过 1200万 开发者一起发现、参与优秀开源项目,私有仓库也完全免费 :)
免费加入
文件
克隆/下载
first.java 1.97 KB
一键复制 编辑 原始数据 按行查看 历史
刘润衡 提交于 2020-10-11 21:00 +08:00 . test 3 (1)
import java.util.Scanner;
public class first {
public static int dajiegou(int a,int b,int answer2){
int c;
if (answer2 == 1) {
c = a + b;
return c;
}
if (answer2 == 2) {
c = a - b;
return c;
}
if (answer2 == 3) {
c = a * b;
return c;
}
if (answer2 == 4) {
c = a % b;
return c;
}
return 1;}}
/* public static void main(String[] args) {
int a, b, c = 0,w=0,i=0;
Scanner scan = new Scanner(System.in);
for(i=0;;i++){
a = scan.nextInt();
b = scan.nextInt();
System.out.println("which means do you want to use?1 for +;2 for -;3 for *;4 for %;");
int answer1 = scan.nextInt();
if (answer1 == 1) {
c = a + b;
}
if (answer1 == 2) {
c = a - b;
}
if (answer1 == 3) {
c = a * b;
}
if (answer1 == 4) {
c = a % b;
}
System.out.println("the result is:" + c);
System.out.println("do you want continue?1 for Y;01 for N");
w=scan.nextInt();
if(w==0)break;}
}*/
//}
/*
public class first{
public static void main(String[] args){
int i =5;
int j =6;
int sum = add(i,j);
System.out.println(sum);
sum =0;
for(i=0;i<100;i++)
sum += i;
System.out.println(sum);
}
public static int add(int augend,int addend){
int sum = augend + addend;
return sum;
}
}*/
/*
public class first{
public static String numberchange(int grade){
if (grade < 60)
return("不及格");
else if(grade < 70)
return("及格");
else if (grade < 80)
return("中等");
else if (grade < 90)
return("良好");
else if (grade <= 100)
return("优秀");
else return("错误");
}
}*/
Loading...
马建仓 AI 助手
尝试更多
代码解读
代码找茬
代码优化
Java
1
https://gitee.com/besti1923/lrh20192304_JAVAProgramrr.git
git@gitee.com:besti1923/lrh20192304_JAVAProgramrr.git
besti1923
lrh20192304_JAVAProgramrr
加-小妹-v.x(20192304)获取-代-码
master

搜索帮助