null - 程序员宅基地

第4章练习题_have a nice year 2020-程序员宅基地

技术标签： Java string import testing go 游戏 class

// ES01.java: Simple method use

import tio.Console;

class ES01 {
    public static void main(String[] args) {
        System.out.println("Type your age:");
        int intAge = Console.in.readInt();
        System.out.println("Happy birthday to you!");
        printMessage(intAge); //method call
        System.out.println("Have a nice year!");
    }

    //definition of method printMessage
    static void printMessage(int intAge) {
        if (intAge == 1)
            System.out.println("You are " + intAge + " year old!");
        else
            System.out.println("You are " + intAge + " years old!");
    }
}

// ES02.java: Simple method use

import tio.Console;

class ES02 {
    public static void main(String[] args) {
        System.out.println("Type your age:");
        int intN = Console.in.readInt();
        System.out.println("Happy birthday to you!");
        printMessage(intN); //method call
        System.out.println("Have a nice year!");
    }

// ES03.java
class ES03 {
    public static void main(String[] args) {
        System.out.println("A TABLE OF POWERS");
        System.out.println("-----------------/n");
        System.out.println("Integer/tSquare/tCube/tQuartic/tQuintic");
        System.out.println("-------/t------/t----/t-------/t-------");
        for (int intI = 1; intI <= 25; intI++) {
            System.out.println(intI + "/t" + square(intI) + "/t"
                    + cube(intI) + "/t" + quartic(intI) + "/t"
                    + quintic(intI));
        }
    }

    static int square(int intNum) {
        return intNum * intNum;
    }

    static int cube(int intNum) {
        return intNum * intNum * intNum;
    }

    static int quartic(int intNum) {
        return square(intNum) * square(intNum);
    }

    static int quintic(int intNum) {
        return square(intNum) * cube(intNum);
    }
}

// ES04.java
class ES04 {
public static void main(String[] args) {
}

    static int max(int x, int y) {
        if (x > y)
            return x;
        else
            return y;
    }

    static double max(double x, double y) {
        if (x > y)
            return x;
        else
            return y;
    }
}

// ES05.java

import tio.*;

class RunSums {
    public static void main(String[] args) {
        System.out.println("Type a number:");
        int intCount = Console.in.readInt();
        printBanner();
        printHeadings();
        readAndPrintData(intCount);
    }

    // printBanner, printHeadings and readAndPrintData
    // definitions will go here
    static void printBanner() {
        System.out.println("/n"
                + "********************************************/n"
                + "*   RUNNING SUMS, MINIMUMS, AND MAXIMUMS   */n"
                + "********************************************/n");
    }

    static void printHeadings() {
        System.out.println("Count/tItem/tSum/tMinimum/tMaximum");
    }

    static void readAndPrintData(int intCount) {
        int cnt = 0, sum = 0, item, smallest, biggest;
        if (intCount > 0) {
            item = Console.in.readInt();
            cnt++;
            sum = sum + item;
            smallest = biggest = item;
            System.out.println(cnt + "/t" + item + "/t" + sum + "/t"
                    + smallest + "/t" + biggest);
            while (cnt != intCount) {
                item = Console.in.readInt();
                cnt++;
                sum = sum + item;
                smallest = min(item, smallest);
                biggest = max(item, biggest);
                System.out.println(cnt + "/t" + item + "/t" + sum
                        + "/t" + smallest + "/t" + biggest);
            }
        }
        System.out.println("Print Complete.");
    }

    static int min(int a, int b) {
        if (a < b)
            return a;
        else
            return b;
    }

    static int max(int a, int b) {
        if (a > b)
            return a;
        else
            return b;
    }
}

// ES06.java

import tio.*;

class ES06 {
    public static void main(String[] args) {
        printBanner();
        printHeadings();
        readAndPrintData();
    }

    static void printHeadings() {
        System.out.println("Count/tItem/tSum/tMinimum/tMaximum");
    }

    static void readAndPrintData() {
        int cnt = 0, sum = 0, item, smallest, biggest;
        item = Console.in.readInt();
        cnt++;
        sum = sum + item;
        smallest = biggest = item;
        System.out.println(cnt + "/t" + item + "/t" + sum + "/t"
                + smallest + "/t" + biggest);
        while (Console.in.hasMoreElements()) {
            item = Console.in.readInt();
            cnt++;
            sum = sum + item;
            smallest = min(item, smallest);
            biggest = max(item, biggest);
            System.out.println(cnt + "/t" + item + "/t" + sum + "/t"
                    + smallest + "/t" + biggest);
        }
    }

    static int min(int a, int b) {
        if (a < b)
            return a;
        else
            return b;
    }

    static int max(int a, int b) {
        if (a > b)
            return a;
        else
            return b;
    }
}

// ES07.java
class ES07 {
    public static void main(String[] args) {
        //Input the number of tosses in a row to try for.
        int numTosses = 5; //Just use 4 for testing
        //Input the number of trials to run.
        int numTrials = 10000; //Use 10000 for testing
        //Perform the specified number of trials
        int numSuccesses = performTrials(numTosses, numTrials);
        //Print the results
        double probability = numSuccesses / (double) numTrials;
        System.out.println("Probability found in " + numTrials
                + " is " + probability);
    }

    // perform numTrials simulated coin tosses
    // and return the number of successes
    static int performTrials(int numTosses, int numTrials) {
        System.out.println("Monte Carlo " + numTosses
                + " in a row heads");
        int numSuccesses = 0;
        for (int trials = 0; trials < numTrials; trials++)
            // perform one trial
            if (isAllHeads(numTosses))
                numSuccesses++; // trial was a success
        return numSuccesses;
    }

    // return true if numTosses heads are tossed
    // before a tail
    static boolean isAllHeads(int numTosses) {
        double outcome;
        for (int numHeads = 0; numHeads < numTosses; numHeads++) {
            outcome = Math.random(); // toss the coin
            if (outcome < 0.2)
                return false; // tossed a tail
        }
        return true; // tossed all heads
    }
}

// ES08.java
class ES08 {
    public static void main(String[] args) {
        //Input the number of tosses in a row to try for.
        int numTosses = 6; //Just use 6 for testing
        //Input the number of trials to run.
        int numTrials = 10000; //Use 10000 for testing
        //Perform the specified number of trials
        int numCount = 10;
        int numSuccesses = performTrials(numCount, numTosses,
                numTrials);
        //Print the results
        double probability = numSuccesses / (double) numTrials;
        System.out.println("Probability found in " + numTrials
                + " is " + probability);
    }

    // perform numTrials simulated coin tosses
    // and return the number of successes
    static int performTrials(int numCount, int numTosses,
            int numTrials) {
        System.out.println("Monte Carlo " + numTosses
                + " in a row heads");
        int numSuccesses = 0;
        for (int trials = 0; trials < numTrials; trials++)
            // perform one trial
            if (almostAllHeads(numCount, numTosses))
                numSuccesses++; // trial was a success
        return numSuccesses;
    }

    static boolean almostAllHeads(int n, int k) {
        int intCount = 0;
        double outcome;
        for (int intI = 1; intI <= n; intI++) {
            outcome = Math.random();
            if (outcome < 0.5)
                intCount++;
        }
        if (intCount >= k)
            return true;
        else
            return false;
    }
}

// ES09.java
class ES09 {
    public static void main(String[] args) {
        //Input the number of tosses in a row to try for.
        int numTosses = 5; //Just use 5 for testing
        //Input the number of trials to run.
        int numTrials = 1000000; //Use 10000 for testing
        //Perform the specified number of trials
        int numCount = 10;
        int numSuccesses = performTrials(numCount, numTosses,
                numTrials);
        //Print the results
        double probability = numSuccesses / (double) numTrials;
        System.out.println("Probability found in " + numTrials
                + " is " + probability);
    }

    static boolean almostAllHeads(int n, int k) {
        int intCount = 0;
        double outcome;
        for (int intI = 1; intI <= n; intI++) {
            outcome = Math.random();
            if (outcome < 0.5)
                intCount++;
        }
        if (intCount == k)
            return true;
        else
            return false;
    }
}

10.

// ES10.java

import tio.*;

class ES10 {
    public static void main(String[] args) {
        System.out.println("Type width, height and Text:");
        int intHeight, intWidth;
        String strText;
        intWidth = Console.in.readInt();
        intHeight = Console.in.readInt();
        strText = Console.in.readWord();
        drawBox(intWidth, intHeight, strText);
    }

    static void drawBox(int intWidth, int intHeight, String strText) {
        drawLine(intWidth, strText);
        drawSides(intHeight, intWidth, strText);
        drawLine(intWidth, strText);
    }

    static void drawLine(int intWidth, String strText) {
        for (int intI = 0; intI < intWidth; intI++) {
            System.out.print(strText + " ");
        }
        System.out.println();
    }

    static void drawSides(int intHeight, int intWidth, String strText) {
        intHeight = intHeight - 2;
        intWidth = intWidth - 2;
        intWidth = intWidth * ((strText).length() + 1);
        for (int intI = 0; intI < intHeight; intI++) {
            System.out.print(strText + " ");
            for (int intJ = 0; intJ < intWidth; intJ++) {
                System.out.print(" ");
            }
            System.out.println(strText + " ");
        }
    }
}

11.

// ES11.java
class ES11 {
    public static void main(String[] args) {
        int intDays = 10;
        weatherReport(intDays);
    }

    private static void weatherReport(int intDays) {
        double dblWeather;
        for (int intI = 0; intI < intDays; intI++) {
            dblWeather = Math.random() * 3;
            if (dblWeather > 2)
                System.out.println("Clody");
            else
                if (dblWeather > 1)
                    System.out.println("Sunny");
                else
                    System.out.println("Rainy");
        }
    }
}

12.

// ES12.java
class ES12 {
    public static void main(String[] args) {
        switch ((int) (10 * Math.random())) {
            case 0:
                break;
            case 1:
                break;
            case 2:
                break;
            case 3:
                break;
            case 4:
                break;
            case 5:
                break;
            case 6:
                break;
            case 7:
                break;
            case 8:
                break;
            case 9:
                break;
        }
    }
}

13.

// ES13.java
class ES13 {
    public static void main(String[] args) {
        double dblX1 = 0.0, dblX2 = 10.0, dblStep = 0.01;
        func(dblX1, dblX2, dblStep);
    }

    static void func(double dblX1, double dblX2, double dblStep) {
        double dblMin, dblMax, dblFunc;
        if (dblX1 < dblX2) {
            dblFunc = dblX1 * dblX1 - 2;
            System.out.println(dblFunc);
            dblMin = dblMax = dblFunc;
            dblX1 = dblX1 + dblStep;
            while (dblX1 < dblX2) {
                dblFunc = dblX1 * dblX1 - 2;
                System.out.println(dblFunc);
                dblMin = min(dblFunc, dblMin);
                dblMax = max(dblFunc, dblMax);
                dblX1 = dblX1 + dblStep;
            }
            System.out.println("The max number is: " + dblMax);
            System.out.println("The min number is: " + dblMin);
        }
    }

    static double min(double dblX, double dblY) {
        if (dblX < dblY)
            return dblX;
        else
            return dblY;
    }

    static double max(double dblX, double dblY) {
        if (dblX > dblY)
            return dblX;
        else
            return dblY;
    }
}

14.

// ES14.java
class ES14 {
    public static void main(String[] args) {
        double a = 0.0, b = 10.0, x, step = 0.001;
        double dblMin, dblX;
        x = a; /* start at one end */
        dblMin = f(x);
        dblX = x;
        while (f(x) != 0.0 && x < b) {
            dblMin = min(f(x), dblMin);
            if (dblMin == f(x))
                dblX = x;
            x = x + step;
        }
        if (x < b)
            System.out.println(" root is " + x);
        else
            System.out.println(" simple root is " + dblX);
    }

    static double f(double x) {
        return (x * x - 2.0);
    }

    static double min(double dblX, double dblY) {
        if (Math.abs(dblX) < Math.abs(dblY))
            return dblX;
        else
            return dblY;
    }
}

15.

// ES15.java
class ES15 {
    public static void main(String[] args) {
        double a = 0.0, b = 5.0, eps = 0.00001;
        double root = 0.0, residual;
        while (b - a > eps) {
            root = (a + b) / 2.0;
            residual = f(root);
            if (residual > 0)
                b = root;
            else
                a = root;
        }
        System.out.println(" root is " + root);
    }

    static double f(double x) {
        return (Math.pow(Math.E, Math.pow(x, 2)) - 10.0);
    }
}

16.

// ES16.java
class ES16 {
    public static void main(String[] args) {
        double a = 0.0, b = 5.0;
        double root = 0.0, result, times = 100;
        for (int intI = 0; intI < times; intI++) {
            result = Math.random() * (b - a) + a;
            if (Math.abs(f(result)) < Math.abs(f(root)))
                root = result;
        }
        System.out.println(" root is " + root);
    }

    static double f(double x) {
        return (Math.pow(Math.E, Math.pow(x, 2)) - 10.0);
    }
}

17.

// ES17.java

import tio.Console;

class ES17 {
    public static void main(String[] args) {
        //初始化游戏者钱数。
        int intMoney = 100;
        System.out.println("You have 100 dollars left.");
        //循环，如果需要退出，输入赌钱数0
        while (intMoney > 0) {
            //游戏者下注
            System.out.println("Put down some money,/n"
                    + "Put 0 for quit.");
            int intBet = Console.in.readInt();
            if (intBet > intMoney)
                continue;
            if (intBet == 0)
                break;
            //游戏者掷骰子
            int intDisc = disc();
            System.out.println("You throw out: " + intDisc);
            //判断结果
            intMoney = result(intMoney, intBet, intDisc);
        }
    }

    static int result(int intMoney, int intBet, int intDisc) {
        //判断swith
        switch (intDisc) {
            case 7:
            case 11:
                intMoney = playerWin(intMoney, intBet);
                break;
            case 2:
            case 12:
                intMoney = playerLose(intMoney, intBet);
                break;
            default:
                //赋值point
                int intPoint = intDisc;
                System.out.println("Your point is " + intPoint);
                //继续掷色子直至7或point
                intDisc = disc();
                System.out.println("Rethrow: " + intDisc);
                while (intDisc != 7 && intDisc != intPoint) {
                    intDisc = disc();
                    System.out.println("Rethrow: " + intDisc);
                }
                if (intDisc == 7)
                    intMoney = playerLose(intMoney, intBet);
                else
                    intMoney = playerWin(intMoney, intBet);
        }
        return intMoney;
    }

    static int disc() {
        int result = 0;
        result = result + (int) (Math.random() * 6) + 1;
        result = result + (int) (Math.random() * 6) + 1;
        return result;
    }

    static int playerWin(int intMoney, int intBet) {
        intMoney = intMoney + intBet;
        System.out.println("You win and earn some money/n"
                + "You have " + intMoney + " dollars left.");
        return intMoney;
    }

    static int playerLose(int intMoney, int intBet) {
        intMoney = intMoney - intBet;
        if (intMoney == 1 || intMoney == 0)
            System.out.println("You lose./n" + "You have " + intMoney
                    + " dollar left.");
        else
            System.out.println("You lose./n" + "You have " + intMoney
                    + " dollars left.");
        return intMoney;
    }
}

18.

// ES18.java
class ES18 {
    public static void main(String[] args) {
        char chrX1 = 'a', chrX2 = 'z';
        charPrint(chrX1, chrX2);
    }

    static void charPrint(char chrX1, char chrX2) {
        if (chrX1 < chrX2) {
            System.out.println(chrX1);
            charPrint((char) (chrX1 + 1), chrX2);
        }
        else
            System.out.println(chrX1);
    }
}

19.

// ES19.java
class ES19 {
    public static void main(String[] args) {
        char chrX1 = 'c', chrX2 = 'g';
        printRange(chrX1, chrX2);
    }

    static void printRange(char first, char last) {
        if (first < last) {
            System.out.println(first);
            printRange((char) (first + 1), last);
        }
        else
            System.out.println(first);
    }
}

20.

// ES20.java
class ES20 {
    public static void main(String[] args) {
        int n = 40;
        System.out.println(fibonacci(n));
    }

    static long fibonacci(int n) {
        int f0 = 0, f1 = 1, f2;
        f2 = f0 + f1;
        for (int i = 2; i <= n; i++) {
            f2 = f0 + f1;
            f0 = f1;
            f1 = f2;
        }
        return f2;
    }
}

本文链接：https://blog.csdn.net/fredonline/article/details/212448

原作者删帖不实内容删帖广告或垃圾文章投诉

智能推荐

攻防世界_难度8_happy_puzzle_攻防世界困难模式攻略图文-程序员宅基地

文章浏览阅读645次。这个肯定是末尾的IDAT了，因为IDAT必须要满了才会开始一下个IDAT，这个明显就是末尾的IDAT了。，对应下面的create_head()代码。，对应下面的create_tail()代码。不要考虑爆破，我已经试了一下，太多情况了。题目来源：UNCTF。_攻防世界困难模式攻略图文

达梦数据库的导出（备份）、导入_达梦数据库导入导出-程序员宅基地

文章浏览阅读2.9k次，点赞3次，收藏10次。偶尔会用到，记录、分享。1. 数据库导出1.1 切换到dmdba用户su - dmdba1.2 进入达梦数据库安装路径的bin目录，执行导库操作　　导出语句：./dexp cwy_init/[email protected]:5236 file=cwy_init.dmp log=cwy_init_exp.log　注释：　　 cwy_init/init_123..._达梦数据库导入导出

js引入kindeditor富文本编辑器的使用_kindeditor.js-程序员宅基地

文章浏览阅读1.9k次。1. 在官网上下载KindEditor文件，可以删掉不需要要到的jsp，asp，asp.net和php文件夹。接着把文件夹放到项目文件目录下。2. 修改html文件，在页面引入js文件：<script type="text/javascript" src="./kindeditor/kindeditor-all.js"></script><script type="text/javascript" src="./kindeditor/lang/zh-CN.js"_kindeditor.js

STM32学习过程记录11——基于STM32G431CBU6硬件SPI+DMA的高效WS2812B控制方法-程序员宅基地

文章浏览阅读2.3k次，点赞6次，收藏14次。SPI的详情简介不必赘述。假设我们通过SPI发送0xAA，我们的数据线就会变为10101010，通过修改不同的内容，即可修改SPI中0和1的持续时间。比如0xF0即为前半周期为高电平，后半周期为低电平的状态。在SPI的通信模式中，CPHA配置会影响该实验，下图展示了不同采样位置的SPI时序图[1]。CPOL = 0，CPHA = 1：CLK空闲状态 = 低电平，数据在下降沿采样，并在上升沿移出CPOL = 0，CPHA = 0：CLK空闲状态 = 低电平，数据在上升沿采样，并在下降沿移出。_stm32g431cbu6

计算机网络-数据链路层_接收方收到链路层数据后,使用crc检验后,余数为0,说明链路层的传输时可靠传输-程序员宅基地

文章浏览阅读1.2k次，点赞2次，收藏8次。数据链路层习题自测问题1.数据链路(即逻辑链路)与链路(即物理链路)有何区别?“电路接通了”与”数据链路接通了”的区别何在?2.数据链路层中的链路控制包括哪些功能?试讨论数据链路层做成可靠的链路层有哪些优点和缺点。3.网络适配器的作用是什么?网络适配器工作在哪一层?4.数据链路层的三个基本问题(帧定界、透明传输和差错检测)为什么都必须加以解决？5.如果在数据链路层不进行帧定界，会发生什么问题？6.PPP协议的主要特点是什么？为什么PPP不使用帧的编号？PPP适用于什么情况？为什么PPP协议不_接收方收到链路层数据后,使用crc检验后,余数为0,说明链路层的传输时可靠传输

软件测试工程师移民加拿大_无证移民，未受过软件工程师的教育（第1部分）-程序员宅基地

文章浏览阅读587次。软件测试工程师移民加拿大无证移民，未受过软件工程师的教育(第1部分) (Undocumented Immigrant With No Education to Software Engineer(Part 1))Before I start, I want you to please bear with me on the way I write, I have very little gen...

随便推点

Thinkpad X250 secure boot failed 启动失败问题解决_安装完系统提示secureboot failure-程序员宅基地

文章浏览阅读304次。Thinkpad X250笔记本电脑，装的是FreeBSD，进入BIOS修改虚拟化配置（其后可能是误设置了安全开机），保存退出后系统无法启动，显示：secure boot failed ，把自己惊出一身冷汗，因为这台笔记本刚好还没开始做备份.....根据错误提示，到bios里面去找相关配置，在Security里面找到了Secure Boot选项，发现果然被设置为Enabled，将其修改为Disabled ，再开机，终于正常启动了。_安装完系统提示secureboot failure

C++如何做字符串分割（5种方法）_c++ 字符串分割-程序员宅基地

文章浏览阅读10w+次，点赞93次，收藏352次。1、用strtok函数进行字符串分割原型： char *strtok(char *str, const char *delim);功能：分解字符串为一组字符串。参数说明：str为要分解的字符串，delim为分隔符字符串。返回值：从str开头开始的一个个被分割的串。当没有被分割的串时则返回NULL。其它：strtok函数线程不安全，可以使用strtok_r替代。示例：//借助strtok实现split#include <string.h>#include <stdio.h&_c++ 字符串分割

2013第四届蓝桥杯 C/C++本科A组真题答案解析_2013年第四届c a组蓝桥杯省赛真题解答-程序员宅基地

文章浏览阅读2.3k次。1 .高斯日记大数学家高斯有个好习惯：无论如何都要记日记。他的日记有个与众不同的地方，他从不注明年月日，而是用一个整数代替，比如：4210后来人们知道，那个整数就是日期，它表示那一天是高斯出生后的第几天。这或许也是个好习惯，它时时刻刻提醒着主人：日子又过去一天，还有多少时光可以用于浪费呢？高斯出生于：1777年4月30日。在高斯发现的一个重要定理的日记_2013年第四届c a组蓝桥杯省赛真题解答

基于供需算法优化的核极限学习机(KELM)分类算法-程序员宅基地

文章浏览阅读851次，点赞17次，收藏22次。摘要：本文利用供需算法对核极限学习机(KELM)进行优化，并用于分类。

metasploitable2渗透测试_metasploitable2怎么进入-程序员宅基地

文章浏览阅读1.1k次。一、系统弱密码登录1、在kali上执行命令行telnet 192.168.26.1292、Login和password都输入msfadmin3、登录成功，进入系统4、测试如下：二、MySQL弱密码登录：1、在kali上执行mysql –h 192.168.26.129 –u root2、登录成功，进入MySQL系统3、测试效果：三、PostgreSQL弱密码登录1、在Kali上执行psql -h 192.168.26.129 –U post..._metasploitable2怎么进入

Python学习之路：从入门到精通的指南_python人工智能开发从入门到精通pdf-程序员宅基地

文章浏览阅读257次。本文将为初学者提供Python学习的详细指南，从Python的历史、基础语法和数据类型到面向对象编程、模块和库的使用。通过本文，您将能够掌握Python编程的核心概念，为今后的编程学习和实践打下坚实基础。_python人工智能开发从入门到精通pdf

第4章练习题_have a nice year 2020-程序员宅基地

智能推荐

攻防世界_难度8_happy_puzzle_攻防世界困难模式攻略图文-程序员宅基地

达梦数据库的导出（备份）、导入_达梦数据库导入导出-程序员宅基地

js引入kindeditor富文本编辑器的使用_kindeditor.js-程序员宅基地

STM32学习过程记录11——基于STM32G431CBU6硬件SPI+DMA的高效WS2812B控制方法-程序员宅基地

计算机网络-数据链路层_接收方收到链路层数据后,使用crc检验后,余数为0,说明链路层的传输时可靠传输-程序员宅基地

软件测试工程师移民加拿大_无证移民，未受过软件工程师的教育（第1部分）-程序员宅基地

随便推点

Thinkpad X250 secure boot failed 启动失败问题解决_安装完系统提示secureboot failure-程序员宅基地

C++如何做字符串分割（5种方法）_c++ 字符串分割-程序员宅基地

2013第四届蓝桥杯 C/C++本科A组真题答案解析_2013年第四届c a组蓝桥杯省赛真题解答-程序员宅基地

基于供需算法优化的核极限学习机(KELM)分类算法-程序员宅基地

metasploitable2渗透测试_metasploitable2怎么进入-程序员宅基地

Python学习之路：从入门到精通的指南_python人工智能开发从入门到精通pdf-程序员宅基地

推荐文章

热门文章

相关标签

第4章 练习题_have a nice year 2020-程序员宅基地

智能推荐

随便推点

推荐文章

热门文章

相关标签

第4章练习题_have a nice year 2020-程序员宅基地