正文
java代码写猴子爬山 小猴子java教程
小程序：扫一扫查出行【扫一扫了解最新限行尾号】
复制小程序
请问以下问题用java代码来求解应该是怎么写
import java.util.Scanner;
/**
* @Author: Cool_Wu
* @Date: 2020-12-07 19:03
*/
public class Transport {
private static final int BOX_A = 1;
private static final int BOX_B = 3;
private static int count_A;
private static int count_B;
public static void main(String[] args) {
System.out.println("请输入宝物数量：");
int count = new Scanner(System.in).nextInt();
if (count 1 || count 50){
System.out.println("宝物数量输入有误！");
return;
}
for (count_B = 0; count_B = count / BOX_B; count_B++){
count_A = count - count_B * BOX_B;
System.out.println("盒子A装运宝物数量：" + BOX_A + "x" + count_A + "=" + BOX_A * count_A);
System.out.println("盒子B装运宝物数量：" + BOX_B + "x" + count_B + "=" + BOX_B * count_B);
System.out.println("宝物装运总数：" + BOX_A * count_A + "+" + BOX_B * count_B + "=" + (BOX_A * count_A + BOX_B * count_B));
System.out.println("-------------------------");
}
System.out.println("装运方案数为：" + count_B);
}
}
运行结果
c/c++/java编程题：聪明的猴子,高分急求大神解答！题目描述如图
能否把样例输出给出，方便验证算法的正确性
下面交流下我的思路
首先我们吧问题转化，变成你一开始有一个原始数字0，你每次可以从数列a中取出一个给他加上或者减去，求可以到达的最小正整数，如果这个数字等于1，那么就说明a这个序列符合要求
然后我们发现这个加加减减的过程很类似 辗转相除法 ，那么显然对于一个数列a 如果其中有两个数字互质，那这个数列就一定符合要求，同样的，如果没有两个数字是互质的，那么这个数列就一定不符合要求。
由于 gcd(1,x)=1 所以也就是说a是符合要求的，当且仅当a中所有元素的gcd=1
这样问题就变成了要求一个序列 a ，要求a中的元素都小于等于B，a 中的最后一个元素为B，且a中所有元素的gcd=1，而这个问题显然可以使用莫比乌斯反演解决
复杂度O(B)，对于题目给出的数据范围显然可以胜任。
这两道题代码怎么写java？
创建一个名字为“ReportCard”的类，然后用下边的内容全部替换掉，你会成为全班最亮的仔。
import java.util.HashMap;
/**
* 学生成绩单
*/
public class ReportCard {
public static void main(String[] args) {
ReportCard reportCard = new ReportCard("张三", "070602213");
reportCard.set("语文", 80.0);
reportCard.set("数学", 59.5);
reportCard.set("英语", 66.0);
reportCard.set("java", 80, 99.0);
reportCard.set("数据库", 80, 66.0);
reportCard.set("毛概", null);
System.out.println(reportCard.getStudentName() + "语文分数:" + reportCard.get("语文"));
System.out.println(reportCard.getStudentName() + "数学考核结果:" + (reportCard.isPassed("数学") ? "合格" : "不合格"));
System.out.println(reportCard.getStudentName() + "期末是否挂科：" + (reportCard.isAllPassed() ? "否" : "是"));
}
// 学生姓名
private String studentName;
// 学生学号
private String studentNumber;
// 成绩单
private HashMapString, CourseResult cards = new HashMap();
public ReportCard() {
}
public ReportCard(String studentName, String studentNumber) {
this.studentName = studentName;
this.studentNumber = studentNumber;
}
public Double get(String courseName){
CourseResult courseResult = cards.get(courseName);
return courseResult == null ? Double.NaN : courseResult.getStudentScore();
}
public void set(String courseName, Double studentScore){
CourseResult courseResult = new CourseResult(courseName, studentScore);
cards.put(courseName, courseResult);
}
public void set(String courseName, double passMark, Double studentScore){
CourseResult courseResult = new CourseResult(courseName, passMark, studentScore);
cards.put(courseName, courseResult);
}
public boolean isPassed(String courseName){
return cards.get(courseName).isPassed();
}
public boolean isAllPassed(){
for(CourseResult cr : cards.values()){
if ( ! cr.isPassed()) {
return false;
}
}
return true;
}
public String getStudentName() {
return studentName;
}
public String getStudentNumber() {
return studentNumber;
}
public void setStudentName(String studentName) {
this.studentName = studentName;
}
public void setStudentNumber(String studentNumber) {
this.studentNumber = studentNumber;
}
/**
* 课程
*/
class Course{
// 课程名称
protected String courseName;
// 及格分
protected double passMark = 60;
public Course(String courseName, Double passMark) {
this.courseName = courseName;
if ( passMark != null) {
this.passMark = passMark;
}
}
}
/**
* 课程成绩
*/
class CourseResult extends Course{
// 学生成绩
private Double studentScore;
public CourseResult(String courseName, Double studentScore) {
this(courseName, null, studentScore);
}
public CourseResult(String courseName, Double passMark, Double studentScore) {
super(courseName, passMark);
this.studentScore = studentScore == null ? Double.NaN : studentScore;
}
public boolean isPassed(){
return studentScore = passMark;
}
public String getCourseName() {
return courseName;
}
public double getPassMark() {
return passMark;
}
public Double getStudentScore() {
return studentScore;
}
}
编写Java程序，用来描述动物园里的猴子。要求如下 （1） 创建一个Monkey（猴子）类，其属性包括颜色和性别
public class Monkey {
private String color;
private String sex;
public Monkey(String color,String sex) {
this.color = color;
this.sex = sex;
}
public Monkey(String color) {
this.color = color;
this.sex = "公";
}
public Monkey(){}
public String getColor() {
return color;
}
public void setColor(String color) {
this.color = color;
}
public String getSex() {
return sex;
}
public void setSex(String sex) {
this.sex = sex;
}
public int add(int p1,int p2,int p3) {
return p1+p2+p3;
}
public int add(int p1,int p2) {
return p1+p2;
}
}
public class Zoo {
public static void main(String[] args) {
Monkey g = new Monkey("黑");
Monkey l = new Monkey("红","母");
int p1 = g.add(1, 2);
int p2 = l.add(1, 2, 3);
System.out.println(g.getSex()+":"+p1);
System.out.println(l.getSex()+":"+p2);
}
}
java代码写猴子爬山的介绍就聊到这里吧，感谢你花时间阅读本站内容，更多关于小猴子java教程、java代码写猴子爬山的信息别忘了在本站进行查找喔。
