《java 语言程序设计》第3、4章编程练习
3.1
public class test {
public static void main(String[] args) {
System.out.println("Enter a, b, c: ");
Scanner input = new Scanner(System.in);
double a = input.nextDouble();
double b = input.nextDouble();
double c = input.nextDouble();
double delta = b * b - 4 * a * c;
double t = Math.pow(delta, 0.5);
if(delta > 0) {
double x1 = (-b + t) / 2;
double x2 = (-b - t) / 2;
System.out.println("The roots are " + x1 + " and " + x2);
} else if (delta == 0) {
System.out.println("The root is " + -b / (2 * a));
} else {
System.out.println("The equation has no real roots");
}
}
}
3.2
public class test {
public static void main(String[] args) {
System.out.println("Enter an integer: ");
Scanner input = new Scanner(System.in);
int n = input.nextInt();
System.out.print("Is " + n + " an even number? ");
if(n % 2 == 0)
System.out.println("true");
else
System.out.println("false");
}
}
3.3
public class test {
public static void main(String[] args) {
System.out.print("Enter a, b, c, d, e, f: ");
Scanner input = new Scanner(System.in);
double a = input.nextDouble();
double b = input.nextDouble();
double c = input.nextDouble();
double d = input.nextDouble();
double e = input.nextDouble();
double f = input.nextDouble();
double fm = a * d - b * c;
if(fm == 0) {
System.out.println("The equation has no solution");
} else {
System.out.println("a is " + ((e * d - b * f) / fm) + " and y is " + ((a * f - e * c) / fm));
}
}
}
3.4
public class test {
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
int a = (int)(Math.random() * 100);
int b = (int)(Math.random() * 100);
System.out.print("Enter the sum of the two integer(0~100): " + a + " and " + b + ": ");
int c = input.nextInt();
if(c == a + b)
System.out.println("True");
else
System.out.println("False");
}
}
3.5
public class test {
public static int judge(int year, int month) {
boolean leap;
leap = (year % 4 ==0 && year % 100 != 0) || (year % 400 == 0);
if(month == 2) {
if(leap) return 29;
else return 28;
} else if(month == 1 || month == 3 || month == 5 || month == 7 || month == 8 || month == 10 || month == 12) {
return 31;
} else {
return 30;
}
}
public static void main(String[] args) {
String[] months = {" ", "January","February","March","April",
"May","June","July","August","September",
"October","November","December"};
System.out.print("Please inpit month and year: ");
Scanner input = new Scanner(System.in);
int month = input.nextInt();
int year = input.nextInt();
System.out.println(months[month] + " " + year + " has " + judge(year, month) + " days");
}
}
4.7
public class test {
public static void main(String[] args) {double n = 10000;
double s1, s2, t;
s1 = s2 = 0;
t = 1;
final double rate = 0.05;
for(int i = 1; i < 11; i++) {
t *= (1 + rate);
}
s1 = n * t;
System.out.println("s1 = " + s1);
}
}
4.16
public class test {
public static void main(String[] args) {
System.out.print("Enter a number: ");
Scanner input = new Scanner(System.in);
int n = input.nextInt();
int i = 2;
while(true) {
while(n % i == 0 && n != i) {
System.out.print(i + ", ");
n /= i;
}
i++;
if(n == i) {
System.out.println(i);
break;
}
}
}
}
4.25
public class test {
public static double countPi(int n) {
double pi = 0;
double t;
int m=1;
for(int i = 1; i < n; i++) {
t=1.0/(2*i-1);
t*=m;
pi+=t;
m*=-1;
}
pi *= 4;
return pi;
}
public static void main(String[] args) {
System.out.print("Enter a number: ");
Scanner input = new Scanner(System.in);
for(int i = 10000; i <= 100000; i++) {
System.out.println("pi(" + i + ") = " + countPi(i));;
}
}
}
4.27
public class test {
public static boolean isLeapYear(int n) {
return ((n % 4 == 0 && n % 100 != 0) || n % 400 == 0);
}
public static void main(String[] args) {
int n = 0;
for(int i = 2001; i < 2100; i++) {
if(isLeapYear(i)) {
n++;
if(n % 11 == 0) {
System.out.println("\n");
} else {
System.out.print(i + " ");
}
}
}
}
}
4.33
public class test {
public static boolean test(int n) {
int i, sum;
int m = n / 2;
sum = 0;
for(i = 1; i <= m; i++) {
if(n % i == 0)
sum += i;
}
if(sum == n)
return true;
else
return false;
}
public static void main(String[] args) {
for(int i = 2; i < 10000; i++) {
if(test(i))
System.out.print(i + "\n");
}
}
}
4.41
public class test {
public static void main(String[] args) {
int n, count , max, t;
Scanner input = new Scanner(System.in);
System.out.println("Enter a number: ");
n = input.nextInt();
t = max = n;
count = 0;
while(t != 0) {
if(t > max) {
count = 1;
max = t;
} else {
count++;
}
System.out.println("Enter a number: ");
t = input.nextInt();
}
System.out.println("max= " + max + ", count= " + count);
}
}
《java 语言程序设计》第3、4章编程练习的更多相关文章
- 《java 语言程序设计》第1章编程练习
1.1 public class test { public static void main(String[] args) { System.out.println("Welcome to ...
- 《java 语言程序设计》第2章编程练习
2.1 public class test { public static void main(String[] args) { Scanner input = new Scanner(System. ...
- Java语言程序设计(基础篇)第一章
第一章 计算机.程序和Java概述 1.1 引言 什么是程序设计呢? 程序设计就是创建(或者开发)软件,软件也称为程序. 1.2 什么是计算机 计算机是存储和处理数据的电子设备,计算机包括硬件(har ...
- Java语言程序设计(基础篇)第二章
第二章 基本程序设计 2.2 编写简单的程序 1.变量名尽量选择描述性的名字(descriptive name). 2.实数(即带小数点的数字)在计算机中使用一种浮点的方法来表示.因此,实数也称为浮点 ...
- 《python语言程序设计》_第二章编程题
2.1 程序: Celsius=eval(input("Enter a degree in Celsius:"))#输入摄氏度的值Celsiusfahrenheit =(9/5)* ...
- 《python语言程序设计》_第一章编程题
题目1.1 :显示"welcome to python " 答案:print('welcome to python') 题目1.2:显示"welcome to pytho ...
- Java语言程序设计-助教篇
1. 给第一次上课(软件工程)的老师与助教 现代软件工程讲义 0 课程概述 给学生:看里面的第0个作业要求 2. 助教心得 美国视界(1):第一流的本科课堂该是什么样?(看里面的助教部分) 助教工作看 ...
- 0031 Java学习笔记-梁勇著《Java语言程序设计-基础篇 第十版》英语单词
第01章 计算机.程序和Java概述 CPU(Central Processing Unit) * 中央处理器 Control Unit * 控制单元 arithmetic/logic unit /ə ...
- 《JAVA语言程序设计》上课笔记
教学目标:1.使学生了解JAVA课程的性质.定位.作用:为什么要学习JAVA?让学生知道如何学好JAVA: 教学内容: 一. 问几个问题 1. 你们到这里来干什么 ...
- Java语言程序设计复习提纲
这是我在准备Java考试时整理的提纲,如果是通过搜索引擎搜索到这篇博客的师弟师妹,建议还是先参照PPT和课本,这个大纲也不是很准确,自己总结会更有收获,多去理解含义,不要死记硬背,否则遇到概念辨析题 ...
随机推荐
- AngularJS Intellisense in Visual Studio 2012
Recently, a lot of people have asked for Intellisense support for AngularJS in the Visual Studio HTM ...
- ref:spring-data-XMLBean XXE复现分析
ref:https://blog.spoock.com/2018/05/16/cve-2018-1259/ 漏洞信息 看pivotal发布的漏洞信息如下 通过发布的漏洞信息可以知道,漏洞组件是在XML ...
- 2017 计蒜之道 初赛 第五场 B. UCloud 的安全秘钥(简单)
暴力. 暴力枚举$S$串的每一个长度为$m$的子串,排序判断即可. #include <iostream> #include <cstdio> #include <cst ...
- java 简单类
package 面向对象编程_封装性; //1.类名称必须存在有意义,例如Book.Emp //2.类之中所有的属性必须用private封装,封装后的属性必须提供有setter和getter方法 // ...
- poj2531(深搜剪枝)
题意就是把节点分成A.B两组,节点间距C给了,要求解分组的方法,使得∑Cij (i∈A,j∈B)最大. 首先把所有节点都放在一组,然后采用深度优先搜索的方法,对每一个节点都做判断是否应该移到另一组去, ...
- prim 算法和 kruskal算法
Prim算法 1.概览 普里姆算法(Prim算法),图论中的一种算法,可在加权连通图里搜索最小生成树.意即由此算法搜索到的边子集所构成的树中,不但包括了连通图里的所有顶点(英语:Vertex (gra ...
- 2018/3/18 noip模拟赛 20分
T1 dp,特别裸特别简单,我放弃了写了个dfs. T2 树归,特别裸特别简单,我不会写. T3 贪心二分不知道什么玩意儿反正不会写就对了. 我是个智障
- BZOJ 1497 JZYZOJ 1344 [NOI2006]最大获利 网络流 最大权闭合图
http://www.lydsy.com/JudgeOnline/problem.php?id=1497 http://172.20.6.3/Problem_Show.asp?id=1344 思路 ...
- POJ 3162 Walking Race 树形dp 优先队列
http://poj.org/problem?id=3162 题意 : 一棵n个节点的树.wc爱跑步,跑n天,第i天从第i个节点开始跑步,每次跑到距第i个节点最远的那个节点(产生了n个距离),现在要 ...
- 2015 UESTC 搜索专题K题 秋实大哥の恋爱物语 kmp
秋实大哥の恋爱物语 Time Limit: 20 Sec Memory Limit: 256 MB 题目连接 http://acm.uestc.edu.cn/#/contest/show/61 De ...