Code – 第88页

[Java] 1005. Spell It Right (20)-PAT甲级

Given a non-negative integer N, your task is to compute the sum of all the digits of N, and output every digit of the sum in English.

Input Specification:

Each input file contains one test case. Each case occupies one line which contains an N (<= 10100).

Output Specification:

For each test case, output in one line the digits of the sum in English words. There must be one space between two consecutive words, but no extra space at the end of a line.

Sample Input:
12345
Sample Output:
one five

题目大意：给一个非负正数N，计算N的每一位相加的和，然后输出和的每一位的英文读音～

PS：感谢github用户@fs19910227提供的pull request～

import java.io.IOException;
import java.io.InputStream;

public class Main {
    static String[] words_table = new String[]{"zero",
            "one", "two", "three", "four", "five",
            "six", "seven", "eight", "nine"};

    public static void main(String[] args) throws IOException {
        InputStream reader = System.in;
        int input, sum = 0;
        while ((input = reader.read()) != '\n') {
            sum += input - 48;
        }
        char[] chars = (sum + "").toCharArray();
        for (int i = 0; i < chars.length; i++) {
            System.out.print(words_table[chars[i] - 48]);
            if (i == chars.length - 1) {
                System.out.println();
            } else {
                System.out.print(" ");
            }
        }
    }
}

import java.io.IOException;

import java.io.InputStream;

public class Main {

static String[] words_table = new String[]{"zero",

"one", "two", "three", "four", "five",

"six", "seven", "eight", "nine"};

public static void main(String[] args) throws IOException {

InputStream reader = System.in;

int input, sum = 0;

while ((input = reader.read()) != '\n') {

sum += input - 48;

}

char[] chars = (sum + "").toCharArray();

for (int i = 0; i < chars.length; i++) {

System.out.print(words_table[chars[i] - 48]);

if (i == chars.length - 1) {

System.out.println();

} else {

System.out.print(" ");

}

[Java] 1003. Emergency (25)-PAT甲级

1003. Emergency (25)
As an emergency rescue team leader of a city, you are given a special map of your country. The map shows several scattered cities connected by some roads. Amount of rescue teams in each city and the length of each road between any pair of cities are marked on the map. When there is an emergency call to you from some other city, your job is to lead your men to the place as quickly as possible, and at the mean time, call up as many hands on the way as possible.

Input

Each input file contains one test case. For each test case, the first line contains 4 positive integers: N (<= 500) – the number of cities (and the cities are numbered from 0 to N-1), M – the number of roads, C1 and C2 – the cities that you are currently in and that you must save, respectively. The next line contains N integers, where the i-th integer is the number of rescue teams in the i-th city. Then M lines follow, each describes a road with three integers c1, c2 and L, which are the pair of cities connected by a road and the length of that road, respectively. It is guaranteed that there exists at least one path from C1 to C2.

Output

For each test case, print in one line two numbers: the number of different shortest paths between C1 and C2, and the maximum amount of rescue teams you can possibly gather.
All the numbers in a line must be separated by exactly one space, and there is no extra space allowed at the end of a line.

Sample Input
5 6 0 2
1 2 1 5 3
0 1 1
0 2 2
0 3 1
1 2 1
2 4 1
3 4 1
Sample Output
2 4
题目大意：n个城市m条路，每个城市有救援小组，所有的边的边权已知。给定起点和终点，求从起点到终点的最短路径条数以及最短路径上的救援小组数目之和。如果有多条就输出点权（城市救援小组数目）最大的那个~

PS：感谢github用户@fs19910227提供的pull request～

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.LinkedList;
import java.util.TreeSet;

public class Main {
    private static BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));

    static class Road implements Comparable<Road> {
        int fromCity, toCity, distance;

        Road(int fromCity, int toCity, int distance) {
            this.fromCity = fromCity;
            this.toCity = toCity;
            this.distance = distance;
        }

        @Override
        public int compareTo(Road o) {
            int compare = distance - o.distance;
            if (compare == 0) {
                compare = toCity - o.toCity;
                return compare == 0 ? fromCity - o.fromCity : compare;
            } else {
                return compare;
            }
        }
    }

    static class Node implements Comparable<Node> {
        int id, rescueTeams = 0, roadLength = 0;

        Node(int id, int rescueTeams) {
            this.id = id;
            this.rescueTeams = rescueTeams;
        }

        @Override
        public int compareTo(Node o) {
            int compare = roadLength - o.roadLength;
            return compare == 0 ? hashCode() - o.hashCode() : compare;
        }

        @Override
        public String toString() {
            return "Node{" +
                    "id=" + id +
                    ", rescueTeams=" + rescueTeams +
                    ", roadLength=" + roadLength +
                    '}';
        }
    }

    static class CityMap {
        final int cityNumbers, start_city, end_city, roadNumbers;
        final int[] rescues;
        final LinkedList<Road>[] roads;

        CityMap() throws IOException {
            int[] ints = readLine();
            this.cityNumbers = ints[0];
            this.roadNumbers = ints[1];
            this.start_city = ints[2];
            this.end_city = ints[3];
            rescues = readLine();
            roads = new LinkedList[cityNumbers];
            for (int i = 0; i < cityNumbers; i++) {
                roads[i] = new LinkedList<>();
            }

            for (int i = 0; i < roadNumbers; i++) {
                //读入路径
                ints = readLine();
                int start = ints[0], end = ints[1], length = ints[2];
                roads[start].add(new Road(start, end, length));
                roads[end].add(new Road(end, start, length));
            }
        }
    }

    private static int[] readLine() throws IOException {
        return Arrays.stream(reader.readLine().split(" "))
                .mapToInt(Integer::valueOf)
                .toArray();
    }

    public static void main(String[] args) throws IOException {
        final CityMap cityMap = new CityMap();
        final int start_city = cityMap.start_city;
        final int end_city = cityMap.end_city;
        int[] rescues = cityMap.rescues;

        boolean[] visited = new boolean[cityMap.cityNumbers];
        TreeSet<Node> nodes = new TreeSet<>();
        nodes.add(new Node(start_city, rescues[start_city]));
        int max_counts = 0;
        int max_rescue_teams = 0;
        int min_load_length = Integer.MAX_VALUE;
        while (!nodes.isEmpty()) {
            Node node = nodes.pollFirst();
            visited[node.id] = true;
            if (node.roadLength > min_load_length) break;
            if (node.id == end_city) {
                min_load_length = node.roadLength;
                max_counts++;
                max_rescue_teams = Math.max(max_rescue_teams, node.rescueTeams);
            }
            for (Road road : cityMap.roads[node.id]) {
                if (!visited[road.toCity]) {
                    Node newNode = new Node(road.toCity, node.rescueTeams + rescues[road.toCity]);
                    newNode.roadLength = node.roadLength + road.distance;
                    nodes.add(newNode);
                }
            }
        }

        System.out.println(max_counts + " " + max_rescue_teams);
    }
}

100

101

102

103

104

105

106

107

108

109

110

111

112

113

114

115

116

117

118

119

120

121

import java.io.BufferedReader;

import java.io.IOException;

import java.io.InputStreamReader;

import java.util.Arrays;

import java.util.LinkedList;

import java.util.TreeSet;

public class Main {

private static BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));

static class Road implements Comparable<Road> {

int fromCity, toCity, distance;

Road(int fromCity, int toCity, int distance) {

this.fromCity = fromCity;

this.toCity = toCity;

this.distance = distance;

}

@Override

public int compareTo(Road o) {

int compare = distance - o.distance;

if (compare == 0) {

compare = toCity - o.toCity;

return compare == 0 ? fromCity - o.fromCity : compare;

} else {

return compare;

}

static class Node implements Comparable<Node> {

int id, rescueTeams = 0, roadLength = 0;

Node(int id, int rescueTeams) {

this.id = id;

this.rescueTeams = rescueTeams;

}

@Override

public int compareTo(Node o) {

int compare = roadLength - o.roadLength;

return compare == 0 ? hashCode() - o.hashCode() : compare;

}

@Override

public String toString() {

return "Node{" +

"id=" + id +

", rescueTeams=" + rescueTeams +

", roadLength=" + roadLength +

'}';

}

static class CityMap {

final int cityNumbers, start_city, end_city, roadNumbers;

final int[] rescues;

final LinkedList<Road>[] roads;

CityMap() throws IOException {

int[] ints = readLine();

this.cityNumbers = ints[0];

this.roadNumbers = ints[1];

this.start_city = ints[2];

this.end_city = ints[3];

rescues = readLine();

roads = new LinkedList[cityNumbers];

for (int i = 0; i < cityNumbers; i++) {

roads[i] = new LinkedList<>();

}

for (int i = 0; i < roadNumbers; i++) {

//读入路径

ints = readLine();

int start = ints[0], end = ints[1], length = ints[2];

roads[start].add(new Road(start, end, length));

roads[end].add(new Road(end, start, length));

}

private static int[] readLine() throws IOException {

return Arrays.stream(reader.readLine().split(" "))

.mapToInt(Integer::valueOf)

.toArray();

}

public static void main(String[] args) throws IOException {

final CityMap cityMap = new CityMap();

final int start_city = cityMap.start_city;

final int end_city = cityMap.end_city;

int[] rescues = cityMap.rescues;

boolean[] visited = new boolean[cityMap.cityNumbers];

TreeSet<Node> nodes = new TreeSet<>();

nodes.add(new Node(start_city, rescues[start_city]));

int max_counts = 0;

int max_rescue_teams = 0;

int min_load_length = Integer.MAX_VALUE;

while (!nodes.isEmpty()) {

Node node = nodes.pollFirst();

visited[node.id] = true;

if (node.roadLength > min_load_length) break;

if (node.id == end_city) {

min_load_length = node.roadLength;

max_counts++;

max_rescue_teams = Math.max(max_rescue_teams, node.rescueTeams);

}

for (Road road : cityMap.roads[node.id]) {

if (!visited[road.toCity]) {

Node newNode = new Node(road.toCity, node.rescueTeams + rescues[road.toCity]);

newNode.roadLength = node.roadLength + road.distance;

nodes.add(newNode);

}

System.out.println(max_counts + " " + max_rescue_teams);

}

[Java] 1002. A+B for Polynomials (25)-PAT甲级

This time, you are supposed to find A+B where A and B are two polynomials.

Input
Each input file contains one test case. Each case occupies 2 lines, and each line contains the information of a polynomial: K N1 aN1 N2 aN2 … NK aNK, where K is the number of nonzero terms in the polynomial, Ni and aNi (i=1, 2, …, K) are the exponents and coefficients, respectively. It is given that 1 <= K <= 10，0 <= NK < … < N2 < N1 <=1000.

Output
For each test case you should output the sum of A and B in one line, with the same format as the input. Notice that there must be NO extra space at the end of each line. Please be accurate to 1 decimal place.

Sample Input
2 1 2.4 0 3.2
2 2 1.5 1 0.5
Sample Output
3 2 1.5 1 2.9 0 3.2

题目大意：计算A+B的和，A和B都是多项式

PS：感谢github用户@fs19910227提供的pull request～

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class Main {
    static class Polynomial {
        private static int MAX_SIZE = 1001;
        private double[] coefficients;

        Polynomial(String[] splits) {
            coefficients = new double[MAX_SIZE];
            for (int i = 1; i < splits.length; i += 2) {
                int exp = Integer.valueOf(splits[i]);
                coefficients[exp] = Double.valueOf(splits[i + 1]);
            }
        }

        Polynomial() {
            coefficients = new double[MAX_SIZE];
        }

        public Polynomial add(Polynomial other) {
            Polynomial result = new Polynomial();
            for (int i = 0; i < MAX_SIZE; i++) {
                double v = this.coefficients[i] + other.coefficients[i];
                v = Math.round(v * 10) / 10.0;
                if (v != 0.0) {
                    result.coefficients[i] = v;
                }
            }
            return result;
        }

        @Override
        public String toString() {
            StringBuilder stringBuilder = new StringBuilder();
            int size = 0;
            for (int i = coefficients.length - 1; i >= 0; i--) {
                double v = coefficients[i];
                if (v != 0.0) {
                    stringBuilder.append(i).append(" ").append(v).append(" ");
                    size++;
                }
            }
            stringBuilder.insert(0, size + " ");
            stringBuilder.deleteCharAt(stringBuilder.length() - 1);
            return stringBuilder.toString();
        }
    }

    private static BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));

    public static String[] readLine() throws IOException {
        return reader.readLine().split(" ");
    }

    public static void main(String[] args) throws IOException {
        Polynomial add = new Polynomial(readLine()).add(new Polynomial(readLine()));
        System.out.println(add);
    }
}

import java.io.BufferedReader;

import java.io.IOException;

import java.io.InputStreamReader;

public class Main {

static class Polynomial {

private static int MAX_SIZE = 1001;

private double[] coefficients;

Polynomial(String[] splits) {

coefficients = new double[MAX_SIZE];

for (int i = 1; i < splits.length; i += 2) {

int exp = Integer.valueOf(splits[i]);

coefficients[exp] = Double.valueOf(splits[i + 1]);

}

Polynomial() {

coefficients = new double[MAX_SIZE];

}

public Polynomial add(Polynomial other) {

Polynomial result = new Polynomial();

for (int i = 0; i < MAX_SIZE; i++) {

double v = this.coefficients[i] + other.coefficients[i];

v = Math.round(v * 10) / 10.0;

if (v != 0.0) {

result.coefficients[i] = v;

}

return result;

}

@Override

public String toString() {

StringBuilder stringBuilder = new StringBuilder();

int size = 0;

for (int i = coefficients.length - 1; i >= 0; i--) {

double v = coefficients[i];

if (v != 0.0) {

stringBuilder.append(i).append(" ").append(v).append(" ");

size++;

}

stringBuilder.insert(0, size + " ");

stringBuilder.deleteCharAt(stringBuilder.length() - 1);

return stringBuilder.toString();

}

private static BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));

public static String[] readLine() throws IOException {

return reader.readLine().split(" ");

}

public static void main(String[] args) throws IOException {

Polynomial add = new Polynomial(readLine()).add(new Polynomial(readLine()));

System.out.println(add);

}

[Java] 1001. A+B Format (20)-PAT甲级

Calculate a + b and output the sum in standard format — that is, the digits must be separated into groups of three by commas (unless there are less than four digits).

Input
Each input file contains one test case. Each case contains a pair of integers a and b where -1000000 <= a, b <= 1000000. The numbers are separated by a space.

Output
For each test case, you should output the sum of a and b in one line. The sum must be written in the standard format.

Sample Input
-1000000 9
Sample Output
-999,991

题目大意：计算A+B的和，然后以每三位加一个”,”的格式输出。

PS：感谢github用户@fs19910227提供的pull request～

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class Main {
    public static void main(String[] args) throws IOException {
        BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
        String[] split = reader.readLine().split(" ");
        Integer x = Integer.valueOf(split[0]) + Integer.valueOf(split[1]);
        char[] chars = x.toString().toCharArray();
        int modOffset = chars.length % 3;
        for (int i = 0; i < chars.length; i++) {
            if (chars[i] == '-') {
                System.out.print('-');
                continue;
            }
            System.out.print(chars[i] - 48);
            if (i == chars.length - 1) {
                System.out.println();
            } else if ((i + 1) % 3 == modOffset) {
                System.out.print(',');
            }
        }
    }
}

import java.io.BufferedReader;

import java.io.IOException;

import java.io.InputStreamReader;

public class Main {

public static void main(String[] args) throws IOException {

BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));

String[] split = reader.readLine().split(" ");

Integer x = Integer.valueOf(split[0]) + Integer.valueOf(split[1]);

char[] chars = x.toString().toCharArray();

int modOffset = chars.length % 3;

for (int i = 0; i < chars.length; i++) {

if (chars[i] == '-') {

System.out.print('-');

continue;

}

System.out.print(chars[i] - 48);

if (i == chars.length - 1) {

System.out.println();

} else if ((i + 1) % 3 == modOffset) {

System.out.print(',');

}

[Java] 1001. 害死人不偿命的(3n+1)猜想 (15)-PAT乙级

1001. 害死人不偿命的(3n+1)猜想 (15)
卡拉兹(Callatz)猜想：
对任何一个自然数n，如果它是偶数，那么把它砍掉一半；如果它是奇数，那么把(3n+1)砍掉一半。这样一直反复砍下去，最后一定在某一步得到n=1。卡拉兹在1950年的世界数学家大会上公布了这个猜想，传说当时耶鲁大学师生齐动员，拼命想证明这个貌似很傻很天真的命题，结果闹得学生们无心学业，一心只证(3n+1)，以至于有人说这是一个阴谋，卡拉兹是在蓄意延缓美国数学界教学与科研的进展……
我们今天的题目不是证明卡拉兹猜想，而是对给定的任一不超过1000的正整数n，简单地数一下，需要多少步（砍几下）才能得到n=1？
输入格式：
每个测试输入包含1个测试用例，即给出自然数n的值。
输出格式：
输出从n计算到1需要的步数。
输入样例：
3
输出样例：
5

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class Main {
  public static void main(String[] args) throws IOException {
    BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));
    int number = Integer.parseInt(bufferedReader.readLine());
    bufferedReader.close();
    int cnt = 0;
    while (number != 1) {
      if (number % 2 != 0) number = 3 * number + 1;
      number /= 2;
      cnt++;
    }
    System.out.print(cnt);
  }
}

import java.io.BufferedReader;

import java.io.IOException;

import java.io.InputStreamReader;

public class Main {

public static void main(String[] args) throws IOException {

BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));

int number = Integer.parseInt(bufferedReader.readLine());

bufferedReader.close();

int cnt = 0;

while (number != 1) {

if (number % 2 != 0) number = 3 * number + 1;

number /= 2;

cnt++;

}

System.out.print(cnt);

}

Mac 蓝牙触控板（Magic trackpad）和原来自带的内建触控板同时使用

之前使用Magic trackpad 2时候出了点小问题，发现断开trackpad后依然无法使用内建触控板，导致自己用了一天的鼠标ORZ……然后就想到了能否两个触控板一起使用的功能……果然在辅助功能里面有～（不过似乎朋友的MacBook里这个功能是默认关闭的，不知道为什么我的是默认打开的…）

所以这个问题也可以解决：蓝牙触控板Magic trackpad断开连接后原触控板依然无法使用的问题

系统偏好设置 – 辅助功能 – 鼠标与触控板 – 取消勾选“有鼠标或无线触控板时忽略内建触控板”