public int abs(int m) {
if (m <= 10&&m>=1) {
if (m == 10) {
return 1;
} else {
return (abs(m + 1) + 1) * 2;
}
} else{
return -1;
}
}
}
public class 猴子吃桃 {
public static void main(String[] args) {
Scanner ml=new Scanner(System.in);
int mi=ml.nextInt();
int m=1;
for(int i=9;i>0;i--){
m=(m+1)*2;
}
System.out.println(m);
AAAB wbs=new AAAB();
int w=wbs.abs(mi);
System.out.println("第"+mi+"天有"+w+"个桃子");
}
}
Java猴子吃桃问题(递归+for循环)
最新推荐文章于 2023-01-05 09:48:18 发布