练习6:编程计算 ∑ 100 n=1 n
package com.lovoinfo;
/**
* 用while循环实现1-100求和
* @author jackfrued
*
*/
public class Test03 {
public static void main(String[] args) {
int sum = 0; // 累加变量
int i = 1; // 循环变量
while(i <= 100) {
sum += i++;
}
System.out.println("Sum = " + sum);
}
}
package com.lovoinfo;
/**
* 用do...while循环实现1-100求和
* @author jackfrued
*
*/
public class Test04 {
public static void main(String[] args) {
int sum = 0;
int i = 1;
do {
sum = sum + i;
i = i + 1;
} while(i <= 100);
System.out.println("Sum = " + sum);
}
}
package com.lovoinfo;
/**
* 使用for循环实现1-100求和
* @author jackfrued
*
*/
public class Test05 {
public static void main(String[] args) {
int sum = 0;
for(int i = 1; i <= 100; ++i) {
sum += i;
}
System.out.println("Sum = " + sum);
}
}
作业:计算1-100之间的偶数的和。
package day0424;
/**
* 求0到100的偶数和
* @author Legendary
*
*/
public class AddUpeven {
public static void main(String[] args) {
int sum = 0 ;//
for (int i = 0; i <= 100; ++i) {
if (i%2 ==0) {
sum +=i;
}
}
System.out.println(sum);
}
}
package day0424;
/**
* 求0到100的偶数和
* @author Legendary
*
*/
public class AddUpeven {
public static void main(String[] args) {
int sum = 0;
for(int i = 2; i<=100;i=i+2){
sum +=i;
}
System.out.println(sum);
}
}
练习7:编程计算 ∑ 10 n=1 1n
package com.lovoinfo;
public class Test06 {
public static void main(String[] args) {
double sum = 0;
for(int i = 1; i <= 10; i++) {
sum = sum + 1.0 / i;
}
System.out.println(sum);
}
}
练习8:编程输入
n
,计算
提示:
n!=n×(n−1)×(n−2)⋯×2×1
package com.lovoinfo;
import java.util.Scanner;
public class Test07 {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.print("n = ");
int n = sc.nextInt();
double result = 1;
for(int i = 1; i <= n; ++i) {
result = result * i;
}
System.out.println(n + "! = " + result);
sc.close();
}
}
作业:输入两个正整数m和n,计算 m n
package day0424;
import java.util.Scanner;
public class Power {
public static void main(String[] args) {
System.out.println("输入一个底数和指数:(正整数)");
Scanner sc = new Scanner(System.in);
int m = sc.nextInt();
int n = sc.nextInt();
int defult = 1;
for (int i = 1; i <= n; ++i) {
defult *= m;
}
System.out.println("幂值为:"+defult);
sc.close();
}
}
练习9:找出1-100之间的素数。
package com.lovoinfo;
/**
* 找出1-100之间的素数(质数, 只能被1和自身整除的数)
* @author jackfrued
*
*/
public class Test12 {
public static void main(String[] args) {
for(int i = 1; i <= 100; i++) {
// 假定当前的i是素数将isPrime赋值为true
boolean isPrime = true;
// 在2-(i-1)之间找寻i的因子
for(int j = 2; isPrime && j <= i - 1; j++) {
// i能被j整除说明它不是素数
if(i % j == 0) {
// 将isPrime修改成false表示i不是素数
isPrime = false;
}
}
// 如果isPrime的值是true说明i是素数就打印它
if(isPrime) {
System.out.println(i);
}
}
}
}
练习10:找出1-100之间的完美数。
提示:完美数是该数除自身外的所有因子之和等于这个数本身的数。如28=1+2+4+7+14。
package day0424;
public class PerfectNumber {
public static void main(String[] args) {
for (int i = 1; i <= 100; ++i) {
int n = 0;
for (int j = 1; j < i; ++j) {
if (i%j==0) {
n+=j;
}
}
if (n==i) {
System.out.println(i);
}
}
}
}
练习11:找出100-999之间的水仙花数。
提示:水仙花数是各位立方和等于这个数本身的数,如
153=1 3 +5 3 +3 3
package com.lovoinfo;
public class Test11 {
public static void main(String[] args) {
for(int i = 100; i <= 999; i++) {
int gw = i % 10;
int sw = i / 10 % 10;
int bw = i / 100;
if(gw * gw * gw + sw * sw * sw + bw * bw * bw == i) {
System.out.println(i);
}
}
// for(int bw = 1; bw <= 9; bw++) {
// for(int sw = 0; sw <= 9; sw++) {
// for(int gw = 0; gw <= 9; gw++) {
// int num = bw * 100 + sw * 10 + gw;
// if(bw * bw * bw + sw * sw * sw + gw * gw * gw == num) {
// System.out.println(num);
// }
// }
// }
// }
}
}
练习12:输入两个正整数,计算最大公约数和最小公倍数。
- 自己:
package day0424;
import java.util.Scanner;
public class FindCommonDivisorMultiples {
public static void main(String[] args) {
System.out.println("输入两个正整数:");
Scanner sc = new Scanner(System.in);
int m = sc.nextInt();
int n = sc.nextInt();
for (int i = m; i <= m; --i) {
if (m % i == 0 && n % i == 0) {
System.out.println("最大公约数为:" + i);
break;
}
}
for (int k = 1;; ++k) {
if (k % m == 0 && k % n == 0) {
System.out.println("最小公倍数为:" + k);
break;
}
}
sc.close();
}
}
- 老师:
package com.lovoinfo;
import java.util.Scanner;
/**
* 输入两个正整数计算最大公约数和最小公倍数
* @author jackfrued
*
*/
public class Test02 {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.print("请输入两个正整数: ");
int num1 = sc.nextInt();
int num2 = sc.nextInt();
if (num1 > num2) {
int temp = num1;
num1 = num2;
num2 = temp;
}
boolean found = false;
for(int i = num1; !found && i >= 1; i--) {
if(num1 % i == 0 && num2 % i == 0) {
System.out.println("最大公约数是: " + i);
System.out.println("最小公倍数是: " + num1 / i * num2);
found = true;
}
}
sc.close();
}
}
练习4:九九表
package com.lovoinfo;
public class Test09 {
public static void main(String[] args) {
for(int i = 1; i <= 9; i++) {
for(int j = 1; j <= i; j++) {
System.out.printf("%d*%d=%d\t", i, j, i * j);
}
System.out.println();
}
}
}
作业:输出直角三角形图案。
package com.lovoinfo;
public class Test10 {
private static final int ROW = 10;
public static void main(String[] args) {
for(int i = 1; i <= ROW; i++) {
for(int j = 1; j <= i; j++) {
System.out.print("*");
}
System.out.println();
}
System.out.println("\n---华丽的分隔线---\n");
for(int i = 1; i <= ROW; i++) {
for(int j = ROW; j >= i; j--) {
System.out.print("*");
}
System.out.println();
}
System.out.println("\n---华丽的分隔线---\n");
for(int i = 1; i <= ROW; i++) {
for(int j = 1; j <= ROW; j++) {
if((ROW - i) >= j) {
System.out.print(" ");
}
else {
System.out.print("*");
}
}
System.out.println();
}
}
}
练习5:百钱百鸡
package com.lovoinfo;
/**
* 百钱买百鸡(穷举法)
* @author jackfrued
*
*/
public class Test14 {
public static void main(String[] args) {
System.out.println("公鸡\t母鸡\t小鸡");
// 假设公鸡x只, 母鸡y只, 小鸡z只
for(int x = 0; x <= 20; x++) {
for(int y = 0; y <= 33; y++) {
int z = 100 - x - y;
if(5 * x + 3 * y + z / 3 == 100 && z % 3 == 0) {
System.out.printf("%d\t%d\t%d\n", x, y, z);
}
}
}
}
}