https://github.com/salmon1802/PAT_B
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
/**
* @date 2021-8-14 - 21:11
* Created by Salmon
*/
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));
char[] chars = bufferedReader.readLine().toCharArray();
int[] num = new int[10];
for(int i = 0; i < chars.length; i++){
if(chars[i] == '0'){
num[0]++;
}else if(chars[i] == '1'){
num[1]++;
}else if(chars[i] == '2'){
num[2]++;
}else if(chars[i] == '3'){
num[3]++;
}else if(chars[i] == '4'){
num[4]++;
}else if(chars[i] == '5'){
num[5]++;
}else if(chars[i] == '6'){
num[6]++;
}else if(chars[i] == '7'){
num[7]++;
}else if(chars[i] == '8'){
num[8]++;
}else if(chars[i] == '9'){
num[9]++;
}
}
for(int i = 0; i < 10; i++){
if(num[i] != 0){
System.out.println(i + ":" + num[i]);
}
}
}
}
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
/**
* @date 2021-8-14 - 21:20
* Created by Salmon
*/
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));
String[] strings = bufferedReader.readLine().split("\\s+");
long n = Long.parseLong(strings[0]) + Long.parseLong(strings[1]);
int D = Integer.parseInt(strings[2]);
ArrayList res = new ArrayList();
for(int i = 0; !(n < D); i++) {
res.add(i, n % D);
n = n / D;
}
res.add(n);
for(int i = res.size() - 1; i >= 0; i--){
System.out.print(res.get(i));
}
}
}
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.lang.reflect.Array;
import java.util.Arrays;
/**
* @date 2021-8-14 - 21:54
* Created by Salmon
*/
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));
String[] strings = bufferedReader.readLine().split("\\s+");
int index = 0;
if(!strings[0].equals("0")){
for(int i = 1; i < strings.length; i++){
if(!strings[i].equals("0")){
index = i;
strings[i] = String.valueOf(Integer.parseInt(strings[i]) - 1);
break;
}
}
System.out.print(index);
for (int i = 0; i < strings.length; i++){
for(int j = 0; j < Integer.parseInt(strings[i]); j++) {
System.out.print(i);
}
}
}else {
for (int i = 0; i < strings.length; i++){
for(int j = 0; j < Integer.parseInt(strings[i]); j++) {
System.out.print(i);
}
}
}
}
}
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.math.BigDecimal;
/**
* @date 2021-8-15 - 00:38
* Created by Salmon
*/
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));
BigDecimal s= new BigDecimal(bufferedReader.readLine());
bufferedReader.close();
System.out.println(s.toPlainString());
}
}
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.*;
/**
* @date 2021-8-15 - 21:18
* Created by Salmon
*/
public class Main1025 {
public static void main(String[] args) throws IOException {
BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));
String[] s = bufferedReader.readLine().split("\\s+");
String nowAdress = s[0];
int n = Integer.parseInt(s[1]);
int revNum = Integer.parseInt(s[2]);
//v1
// ArrayList<Node> list = new ArrayList();
// for (int i = 0; i < n; i++) { //读取结点
// String[] strings = bufferedReader.readLine().split("\\s+");
// Node node = new Node();
// node.adress = strings[0];
// node.Data = Long.parseLong(strings[1]);
// node.next = strings[2];
// list.add(node);
// }
// bufferedReader.close();
//
// ArrayList<Node> list2 = new ArrayList(); //排序好的结点
// for (int i = 0; i < list.size(); i++) {
// int isFind = 0;
// for (int j = 0; j < list.size(); j++) {
// if(list.get(j).adress.equals(nowAdress)){
// list.get(j).order = i + 1;
// list2.add(list.get(j));
// nowAdress = list.get(j).next;
// isFind++;
// break;
// }
// }
// if(isFind != 1){
// break;
// }
// }
//v2
HashMap<String, Node> hashMap = new HashMap<String, Node>();
for (int i = 0; i < n; i++) {
String[] strings = bufferedReader.readLine().split("\\s+");
Node node = new Node();
node.adress = strings[0];
node.Data = Long.parseLong(strings[1]);
node.next = strings[2];
hashMap.put(node.adress,node);
}
ArrayList<Node> list2 = new ArrayList();
while (!nowAdress.equals("-1")){
Node node = hashMap.get(nowAdress);
list2.add(node);
nowAdress = node.next;
}
if(n / revNum == 0){
for(Node node : list2){
System.out.println(node.toString());
}
}else {
ArrayList<Node> list1 = new ArrayList<>();
for(int i = 0; i < (list2.size() / revNum) *revNum; i = i + revNum) {
for(int j = i + revNum - 1; j >= i; j--) {
list1.add(list2.get(j));
}
}
for(int i = (list2.size() / revNum) *revNum; i < list2.size(); i++){
list1.add(list2.get(i));
}
if(n % revNum == 0){
for(int i = 0; i < list2.size() - 1; i++){
list1.get(i).next = list1.get(i + 1).adress;
}
}else{
for(int i = 0; i < (list2.size() / revNum) *revNum; i++){
list1.get(i).next = list1.get(i + 1).adress;
}
}
for(Node node : list1){
System.out.println(node.toString());
}
}
}
}
class Node{
String adress;
long Data;
long order;
String next;
@Override
public String toString() {
return adress + " " + Data + " " + next;
}
}