41.
import java.util.Scanner;
public class Demo41 extends Object{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.println("请输入要打印的行数:");
int line = sc.nextInt();
for (int i = 1; i <= line; i++){
for (int j = (line - i); j > 0; j--) {
System.out.print(" ");
}
for (int k = i; k > 0 ; k--) {
System.out.print(k + " ");
}
if (i >= 2){
for (int n = 2; n <= i; n++){
System.out.print(n + " ");
}
}
System.out.println();
}
}
}
42.
public class Demo42 {
public static void main(String[] args) {
pattern01();
pattern02();
pattern03();
pattern04();
}
public static void pattern01(){
System.out.println("图案1");
for (int i = 1; i <= 6; i++){
for (int j = 1; j <= i; j++){
System.out.print(j + " ");
}
System.out.println();
}
System.out.println();
}
public static void pattern02() {
System.out.println(" 图案2");
for (int i = 6; i >= 1; i--) {
for (int j = 1; j <= i; j++){
System.out.print(j + " ");
}
System.out.println();
}
System.out.println();
}
public static void pattern03() {
System.out.println(" 图案3");
for (int i = 1; i <= 6; i++) {
for (int j = 6 - i; j >= 1; j--) {
System.out.print(" ");
}
for (int j = i; j >= 1; j--){
System.out.print(j + " ");
}
System.out.println();
}
System.out.println();
}
public static void pattern04() {
System.out.println(" 图案4");
for (int i = 6, k = 1; i >= 1; i--, k++) {
for (int j = 1; j < k; j++){
System.out.print(" ");
}
for (int j = 1; j <= i; j++){
System.out.print(j + " ");
}
System.out.println();
}
}
}
43.
public class Demo43 {
public static void main(String[] args) {
for(int line = 8; line >= 1; line--)
{
for(int i = 1; i <= 2 * (line - 1); i++){
System.out.print(" ");
}
for(int i = 1; i <= (9 - line); i++){
int temp = (int) Math.pow(2, i-1);
System.out.print(temp + "\t");
}
for(int i = (8 - line); i >= 1; i--){
int temp = (int)Math.pow(2, i - 1);
System.out.print(temp + "\t");
}
System.out.println();
}
}
}
44.
public class Demo44 {
public static void main(String[] args) {
int count = 0;
for (int i = 2; i <= 1000; i++){
if (isPrime(i)){
System.out.print(i + " ");
count++;
if (count % 8 == 0){
System.out.println();
}
}
}
}
public static boolean isPrime(int n){
for (int i = 2; i < n; i++){
for (int j = 2; j < i; j++){
if (n % j == 0){
return false;
}
}
}
return true;
}
}
45.
public class Demo45 {
public static void main(String[] args) {
double sum = 0;
for(double i = 1; i <= 97;i += 2){
sum = sum + i / (i + 2);
}
System.out.println("和为:" + sum);
}
}
46.
public class Demo46 {
public static void main(String[] args) {
double Pi = valueOfPI(10000000);
System.out.println(Pi);
}
public static double valueOfPI(int n) {
double pi = 0;
for (int i = 1; i <= n; i++){
pi += Math.pow(-1, i + 1) / (2 * i - 1);
}
return pi * 4;
}
}
47.
public class Demo47 {
public static void main(String[] args) {
valueOfE();
}
public static void valueOfE(){
double sum = 1;
double e = 1;
for (int i = 1; i <= 100000; i++) {
sum *= 1.0 / i;
e += sum;
if (i % 10000 == 0){
System.out.println(e);
}
}
}
}
48.
public class Demo48 {
public static void main(String[] args) {
perfectNumber();
}
public static void perfectNumber(){
for (int i = 2; i < 10000; i++){
int sum = 0;
for (int j = 1; j < i; j++){
if (i % j == 0){
sum += j;
}
}
if (sum == i){
System.out.println(i);
}
}
}
}
49.
import java.util.Random;
import java.util.Scanner;
public class Demo49 {
static Scanner sc = new Scanner(System.in);
public static void main(String[] args) {
guessThePunch();
}
public static void guessThePunch(){
Random random = new Random();
int computer = random.nextInt(3);
int count1 = 0;
int count2 = 0;
while (true){
System.out.println("请输入0、1或者2(0表示石头,1表示剪刀,2表示布):");
int human = sc.nextInt();
while (human < 0 || human > 2){
System.out.println("输入错误!!!");
System.out.println("请输入0、1或者2(0表示石头,1表示剪刀,2表示布):");
human = sc.nextInt();
if (human >= 0 && human <= 2){
break;
}
}
System.out.println("计算机:" + computer);
int temp = computer - human;
if (temp == 0){
System.out.println("平局");
}else if (temp == -1 || temp == 2){
System.out.println("这一局计算机赢了");
count2++;
}else {
System.out.println("这一局用户赢了");
count1++;
}
if (count1 == 2){
System.out.println("用户赢了");
break;
}
if (count2 == 2){
System.out.println("计算机赢了");
break;
}
}
}
}
50.
import java.util.Scanner;
public class Demo50 {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.println("请输入一个十进制整数:");
int num = sc.nextInt();
System.out.println(num + "的二进制数为:" + toBinaryString(num));
}
public static String toBinaryString(int n){
String s = "";
while (n != 0){
s = n % 2 + s;
n /= 2;
}
return s;
}
}
51.
import java.util.Scanner;
public class Demo51 {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.println("请输入一个十进制整数:");
int num = sc.nextInt();
System.out.println(num + "的八进制数为:" + toOctalString(num));
}
public static String toOctalString(int n){
String s = "";
while (n != 0){
s = n % 8 + s;
n /= 8;
}
return s;
}
}
52.
import java.util.Scanner;
public class Demo52 {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.println("请输入整数:");
int n = sc.nextInt();
int max = n;
int count = 1;
while (n != 0){
n = sc.nextInt();
if (n > max){
max = n;
count = 1;
}else if (n == max){
count++;
}
}
System.out.println("最大数为:" + max);
System.out.println("最大数出现的次数为:" + count);
}
}
53.
import java.util.Scanner;
public class Demo53 {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.println("请输入三角形的三边的长度:");
double a = sc.nextDouble();
double b = sc.nextDouble();
double c = sc.nextDouble();
theAngle(a, b, c);
}
public static void theAngle(double a, double b, double c){
if (isTriangle(a, b , c)){
double A = Math.acos((Math.pow(a, 2) - Math.pow(b, 2) -Math.pow(c, 2)) / (-2 * b * c));
double B = Math.acos((Math.pow(b, 2) - Math.pow(a, 2) -Math.pow(c, 2)) / (-2 * a * c));
double C = Math.acos((Math.pow(c, 2) - Math.pow(b, 2) -Math.pow(a, 2)) / (-2 * a * b));
System.out.println("角A = " + A);
System.out.println("角B = " + B);
System.out.println("角C = " + C);
}else {
System.out.println("这三条边不能组成三角形");
}
}
public static boolean isTriangle(double a, double b, double c){
if (a + b > c && a + c > b && b + c > a){
return true;
}
return false;
}
}
54.
55.
import java.util.Scanner;
public class Demo55 {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.println("请输入一个十六进制数:");
String num = sc.next();
HexadecimalToDecimal(num);
}
public static void HexadecimalToDecimal(String num){
char[] c = num.toCharArray();
int sum = 0;
for (int i = c.length - 1; i >= 0; i--){
int decNum = (c[i] <= '9' && c[i] >= '0') ? (c[i] - '0') : (c[i] - 'A' + 10);
sum += decNum * Math.pow(16, c.length - 1 - i);
}
System.out.println(num + "转换为十进制为" + sum);
}
}
56.
import java.util.Scanner;
public class Demo56 {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.println("请输入五边形中心到顶点的距离:");
double r = sc.nextDouble();
System.out.println("五边形的面积为:" + pentagonArea(r));
}
public static double pentagonArea(double r){
double s = 2 * r * Math.sin(Math.PI / 5);
double area = (5 * Math.pow(s, 2)) / (4 * Math.tan(Math.PI / 5));
return area;
}
}
57.
import java.util.Scanner;
public class Demo57 {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.println("请输入正多边形的边的个数:");
int n = sc.nextInt();
System.out.println("请输入正多边形的边长:");
double s = sc.nextDouble();
System.out.println("正多边形的面积为:" + zhenShapedArea(n, s));
}
public static double zhenShapedArea(int n, double s){
double area = (n * Math.pow(s, 2)) / (4 * Math.tan(Math.PI / n));
return area;
}
}
58.
import java.util.Scanner;
public class Demo58 {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.println("请输入一个ASCII码(0~127之间的整数):");
int n = sc.nextInt();
if (n >= 0 && n <= 127){
char c = (char) n;
System.out.println("The chararter for ASCII code " + n + " is " + c);
}else {
System.out.println("输入错误!!!");
}
}
}
59.
import java.util.Scanner;
public class Demo59 {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.println("请输入一个0~15的整数:");
int num = sc.nextInt();
String s = "";
if (num >= 0 && num <= 15){
if (num < 10){
s += num;
}else {
s += (char)(num - 10 + 'A');
}
System.out.println(num + "的十六进制数是:" + s);
}else {
System.out.println("输入错误!!!");
}
}
}
60.
import java.util.Scanner;
public class Demo60 {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.println("请输入第一个字符串s1:");
String s1 = sc.next();
System.out.println("请输入第一个字符串s2:");
String s2 = sc.next();
if (s1.contains(s2)){
System.out.println(s2 + "是" + s1 + "的子串");
}else {
System.out.println(s2 + "不是" + s1 + "的子串");
}
}
}
61.
import java.util.Scanner;
public class Demo61 {
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
System.out.println("请输入一个社保号码:");
String str = input.nextLine();
if (isSocialSecurityNumber(str)){
System.out.println(str + " 是一个社保号码");
}else {
System.out.println(str + " 不是一个社保号码");
}
}
public static boolean isSocialSecurityNumber(String str){
if (str.length() == 11){
if (str.charAt(3) == '-' && str.charAt(6) == '-'){
for (int i = 0; i < str.length(); i++){
if (i == 3 || i == 6){
continue;
}else {
if (Character.isDigit(str.charAt(i))){
return true;
}
}
}
}
return false;
}
return false;
}
}
62.
import java.util.Scanner;
public class Demo62 {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.println("请输入一个字符串:");
String s = sc.next();
System.out.println("反转后的字符串为:" + reverse(s));
}
public static String reverse(String s){
String str = "";
for (int i = s.length() - 1; i >= 0; i--){
str += s.charAt(i);
}
return str;
}
}
63.
import java.util.Scanner;
public class Demo63 {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.println("请输入ISBN-13前12为:");
String str = sc.next();
int sum = 0;
int result;
if(str.length() == 12){
for (int i = 0; i < str.length(); i++){
if (i == 0 || i % 2 == 0){
sum += str.charAt(i) - '0';
}else {
sum += 3 * (str.charAt(i) - '0');
}
}
result = 10 - (sum % 10);
if (result == 10){
result = 0;
}
System.out.println("ISBN-13的结果为:" + str + result);
}else {
System.out.println(str + "输入错误!!");
}
}
}
64.
import java.util.Scanner;
public class Demo64 {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.println("请输入一个字符串:");
String str = sc.nextLine();
for (int i = 0; i < str.length(); i++){
if (i == 0 || i % 2 == 0){
System.out.print(str.charAt(i));
}
}
}
}
65.
import java.util.Scanner;
public class Demo65 {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.println("请输入一个字符串:");
String str = sc.nextLine();
int count = 0;
for (int i = 0; i < str.length(); i++){
if (str.charAt(i) >= 'A' && str.charAt(i) <= 'Z'){
count++;
}
}
System.out.println("这个字符串中的大写字母的个数为:" + count);
}
}
66.
import java.util.Scanner;
public class Demo66 {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.println("请输入第一个字符串:");
String s1 = sc.nextLine();
System.out.println("请输入第二个字符串:");
String s2 = sc.nextLine();
while (s1 != null && s2 != null){
if (s1.charAt(0) != s2.charAt(0)){
System.out.println("没有公共前缀!");
}else {
if (s1.startsWith(s2)){
System.out.println("这两个字符串的最长公共前缀是: " + s2);
break;
}else {
s2 = s2.substring(0, s2.length()- 1);
}
}
}
}
}
67.
import java.util.Scanner;
public class Demo67 {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.println("请输入一个整数:");
long n = sc.nextLong();
System.out.println(n + "的所有数字的和为:" + sumDigites(n));
}
public static int sumDigites(long n){
int sum = 0;
while (n != 0){
sum += n % 10;
n /= 10;
}
return sum;
}
}
68.
import java.util.Scanner;
public class Demo68 {
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
System.out.println("请输入一个整数:");
int num = sc.nextInt();
if (isPalindrome(num)){
System.out.println(num + "是回文数");
}else {
System.out.println(num + "不是回文数");
}
}
public static int reverse(int number){
int temp = 0;
while (number != 0){
temp = temp * 10 + number % 10;
number /= 10;
}
return temp;
}
public static boolean isPalindrome(int number){
if (number == reverse(number)){
return true;
}
return false;
}
}
69.
import java.util.Random;
import java.util.Scanner;
public class Demo69 {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.println("请输入一个整数n:");
int n = sc.nextInt();
printMatrix(n);
}
public static void printMatrix(int n){
Random r = new Random();
for (int i = 0; i < n; i ++){
for (int j = 0; j < n; j++){
int temp = r.nextInt(2);
System.out.print(temp + " ");
}
System.out.println();
}
}
}
70.
import java.util.Scanner;
public class Demo70 {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.println("请输入一个密码");
String password = sc.nextLine();
if (isValidPassword(password)){
System.out.println("Valid Password");
}else {
System.out.println("Invalid Password");
}
}
public static boolean isValidPassword(String pw){
int count = 0;
if (pw.length() >= 8 && pw.length() <= 16){
for (int i = 0; i < pw.length(); i++){
if (pw.charAt(i) >= 'A' && pw.charAt(i) <= 'Z'
|| pw.charAt(i) >= 'a' && pw.charAt(i) <= 'z'
|| pw.charAt(i) >= '0' && pw.charAt(i) <= '9'){
if (pw.charAt(i) >= '0' && pw.charAt(i) <= '9'){
count++;
}
}else{
return false;
}
}
if (count >= 2){
return true;
}else {
return false;
}
}else {
return false;
}
}
}
71.
import java.util.Scanner;
public class MyTriangle{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.println("请输入三角形的三边的长度:");
double side1 = sc.nextDouble();
double side2 = sc.nextDouble();
double side3 = sc.nextDouble();
if (isValid(side1, side2, side3)){
System.out.println("三角形的面积为:" + area(side1, side2, side3));
}else {
System.out.println("输入无效!!!");
}
}
public static boolean isValid(double side1, double side2, double side3){
if ((side1 + side2) > side3 && (side1 + side3) > side2 && (side2 + side3) > side1){
return true;
}else {
return false;
}
}
public static double area(double side1, double side2, double side3){
double p = (side1 + side2 + side3) / 2;
double area = Math.pow((p * (p - side1) * (p - side2) * (p - side3)), 0.5);
return area;
}
}
72.
import java.util.Scanner;
public class Demo72 {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.println("请输入一个字符串:");
String str = sc.nextLine();
System.out.println("该字符串中的字母的个数为:" + countLetters(str));
}
public static int countLetters(String s){
int count = 0;
for (int i = 0; i < s.length(); i++){
if (s.charAt(i) >= 'A' && s.charAt(i) <= 'Z'
|| s.charAt(i) >= 'a' && s.charAt(i) <= 'z'){
count++;
}
}
return count;
}
}
73.
import java.util.Scanner;
public class Demo73 {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.println("请输入一个数:");
long n = sc.nextLong();
System.out.println(n + "的平方根是:" + sqrt(n));
}
public static double sqrt(long n){
double lastGuess = 1.0;
double nextGuess = (lastGuess + n / lastGuess) / 2;
double temp = nextGuess - lastGuess;
while (temp > 0.0001){
lastGuess = nextGuess;
nextGuess = (lastGuess + n / lastGuess) / 2;
temp = nextGuess - lastGuess;
if (temp < 0){
temp = -temp;
}
}
return nextGuess;
}
}
74.
public class Demo74 {
public static void main(String[] args) {
for (int i = 2, count = 0; count < 100; i++){
if (isPalindrome(i) && isPrime(i)){
count++;
System.out.print(i + " ");
if (count % 10 == 0){
System.out.println();
}
}
}
}
public static int reverse(int number){
int temp = 0;
while (number != 0){
temp = temp * 10 + number % 10;
number /= 10;
}
return temp;
}
public static boolean isPalindrome(int number){
if (number == reverse(number)){
return true;
}
return false;
}
public static boolean isPrime(int n){
for (int i = 2; i < n ; i++){
if (n % i == 0){
return false;
}
}
return true;
}
}
75.
public class Demo75 {
public static void main(String[] args) {
for (int i = 2, count = 0; count < 100; i++){
if (!isPalindrome(i) && isPrime(i)){
if (isPrime(reverse(i))){
count++;
System.out.print(i + " ");
if (count % 10 == 0){
System.out.println();
}
}
}
}
}
public static int reverse(int number){
int temp = 0;
while (number != 0){
temp = temp * 10 + number % 10;
number /= 10;
}
return temp;
}
public static boolean isPalindrome(int number){
if (number == reverse(number)){
return true;
}
return false;
}
public static boolean isPrime(int n){
for (int i = 2; i < n ; i++){
if (n % i == 0){
return false;
}
}
return true;
}
}
76.
public class Demo76 {
public static void main(String[] args) {
System.out.println("p\t\t\t2^p-1");
System.out.println("----------------------");
for (int p = 2; p <= 31; p++){
if (isPrime((int) Math.pow(2, p) - 1)){
System.out.println(p + "\t\t\t" + ((int) Math.pow(2, p) - 1));
}
}
}
public static boolean isPrime(int n){
for (int i = 2; i < n ; i++){
if (n % i == 0){
return false;
}
}
return true;
}
}
77.
public class Demo77 {
public static void main(String[] args) {
for (int i = 2; i < 1000; i++){
if (isPrime(i) && isPrime(i + 2)){
System.out.println("(" + i + "," + (i + 2) + ")");
}
}
}
public static boolean isPrime(int n){
for (int i = 2; i < n ; i++){
if (n % i == 0){
return false;
}
}
return true;
}
}
78.
import java.util.Scanner;
public class Demo78 {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.println("请输入五边形的边长:");
double side = sc.nextDouble();
System.out.println("五边形的面积为:" + area(side));
}
public static double area(double side){
double area = (5 * Math.pow(side, 2)) / (4 * Math.tan(Math.PI / 5));
return area;
}
}
79.
import java.util.Scanner;
public class Demo79 {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.println("请输入正多边形的边的个数:");
int n = sc.nextInt();
System.out.println("请输入正多边形的边长:");
double side = sc.nextDouble();
System.out.println("正多边形的面积为:" + area(n, side));
}
public static double area(int n, double side){
double area = (n * Math.pow(side, 2)) / (4 * Math.tan(Math.PI / n));
return area;
}
}
80.
递归解决斐波那契数列
import java.util.Scanner;
public class Demo80 {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.print("请输入您要查询的项数:");
int n = sc.nextInt();
System.out.println(fibonacci(n));
}
public static int fibonacci(int n){
if (n == 0){
return 0;
}
if (n == 1){
return 1;
}
if (n == 2){
return 1;
}
return fibonacci(n - 1) + fibonacci(n - 2);
}
}