Reboot

import java.util.Scanner;public class Main{    private static Scanner cin;    public static int STOOL_HEIGHT = 30;        public static void main(String args[])throws Exception {        cin = n...

目录暴力递归递归+剪枝暴力递归递归当n较大时，会TLEimport java.util.Scanner;public class Main { private static Scanner cin; public static void main(String args[]) throws Exception { cin = new Scanner(System...

 import java.util.Arrays;import java.util.Scanner;public class Main { private static Scanner cin; private static boolean hasFound = false; public static void main(String args[]) throws Exc...

 import java.util.Scanner;public class Main { private static Scanner cin; public static void main(String args[]) throws Exception { cin = new Scanner(System.in); int n = cin.nextInt(); ...

这个题比较坑，要注意的是（1）0.0或00.00最后应该是0.0（2） 0/0或00/00最后应该是0/0import java.util.Scanner;public class Main { private static Scanner cin; public static void main(String args[]) throws Exception { ci...

 import java.util.Scanner;public class Main { private static Scanner cin; private static int[] numbers ; private static int counter = 0; public static void main(String args[]) throws Except...

为了避免在输入时5,1000000000的情况下超时，增加如下判断：            //如果可以被2、3、5整除，必然不满足条件，直接跳过            if(i!= 2 && i!=3 && i!=5 && (i%2==0 || i%3==0 || i%5==0)) {                continue;  ...

 import java.util.Arrays;import java.util.LinkedList;import java.util.Scanner;public class Main { private static Scanner cin; public static void main(String args[]) throws Exception { cin...

最初的方案，在calc函数里增加了第三个参数String，用来存储前面已经累积的数字，在满足条件是打印。但TLE了，所以增加了condiments数组，这样减少字符操作，提升效率import java.util.Arrays;import java.util.Iterator;import java.util.LinkedList;import java.util.Scanner;...

 import java.util.LinkedList;import java.util.Scanner;public class Main { private static Scanner cin; private static LinkedList<String> list; private static int initSpeed = 7; private ...

https://www.luogu.org/problemnew/show/P1540import java.util.LinkedList;import java.util.Scanner;public class Main { private static Scanner cin; public static void main(String args[]) throws ...

https://www.luogu.org/problemnew/show/P1464import java.util.HashMap;import java.util.Iterator;import java.util.LinkedList;import java.util.Scanner;public class Main { private static Scanner c...

 import java.util.Scanner;public class Main { private static Scanner cin; public static void main(String args[]) throws Exception { cin = new Scanner(System.in); int n = cin.nextInt(); ...

https://www.luogu.org/problemnew/show/P1017顺便了解一下取模的计算，可以参考WIKI:https://en.wikipedia.org/wiki/Modulo_operation给定一个正整数q，任意一个整数a，一定存在等式 ：a =nq + r;其中 n、r 是整数，且 0 ≤ r < q，则称 n 为a 除以 q 的商，r 为 a...

https://www.luogu.org/problemnew/show/P1003import java.util.Iterator;import java.util.LinkedList;import java.util.Scanner;public class Main { private static Scanner cin; public static void ...

https://www.luogu.org/problemnew/show/P1067import java.util.Scanner;public class Main { private static Scanner cin; public static void main(String args[]) throws Exception { cin = new Scann...

https://www.luogu.org/problemnew/show/P1018import java.math.BigInteger;import java.util.Scanner;public class Main { private static Scanner cin; private static char[] values; private static Bi...

 import java.util.Scanner;public class Main { private static Scanner cin; public static void main(String args[]) throws Exception { cin = new Scanner(System.in); int n = cin.nextInt(); n...

 import java.util.Scanner;public class Main { private static Scanner cin; public static void main(String args[]) throws Exception { cin = new Scanner(System.in); int maxChar = 0; int[] c...

import java.util.Scanner;public class Main{    private static Scanner cin;        public static void main(String args[])throws Exception {        cin = new Scanner(System.in);        int n = ci...

import java.util.Scanner;public class Main{    private static Scanner cin;        public static void main(String args[])throws Exception {        cin = new Scanner(System.in);        int k = ci...

import java.util.Iterator;import java.util.LinkedList;public class Main {    public static void main(String args[]) {        int MAX = 329;        LinkedList<Integer> list_1 = new LinkedLi...

import java.util.Scanner;public class Main{    private static Scanner cin;        public static double nextDistence(double distence) {        return distence*0.98;    }    public static void m...

import java.util.Scanner;public class Main{    private static Scanner cin;        public static void main(String args[])throws Exception {        cin = new Scanner(System.in);        int number...

import java.util.Scanner;import java.util.regex.Matcher;import java.util.regex.Pattern;public class Main{    private static Scanner cin;        public static void main(String args[])throws Exc...

import java.util.Scanner;public class Main{    private static Scanner cin;        public static void main(String args[])throws Exception {        cin = new Scanner(System.in);        String co...

import java.util.LinkedList;import java.util.Scanner;public class Main {    private static Scanner cin;    public static void main(String args[]) throws Exception {        cin = new Scanner(Sy...

练习P1567时，由于Scanner的处理效率影响，导致提交后有5个TLE~，优化后采用BufferedReader结合StringTokenizer提供效率，可以全部通过，关于StringTokenizer，源码及批注参见：https://mp.csdn.net/postedit/81813045目录StringTokenizer版本：String结合数组版本Scanner版本：...

import java.util.Scanner;public class Main{    private static Scanner cin;    public static int DISTENCE = 250;    public static int DAYS_A_WEEK = 5;        public static void main(String args[...

 练习此题时，如果使用BufferedReader结合StringTokenizer替代Scanner，始终提升RE（Runtime Error），还没找到根本原因import java.io.BufferedReader;import java.io.IOException;import java.io.InputStream;import java.io.InputStreamRe...

import java.util.Iterator;import java.util.LinkedList;import java.util.Scanner;class Zone{    int start;    int end;    Zone(int start, int end){        this.start = start;        this.end = ...

import java.util.ArrayList;import java.util.Collections;import java.util.Iterator;import java.util.Scanner;public class Main{    private static Scanner cin;        public static void main(Stri...

 import java.util.Scanner;import java.util.regex.Matcher;import java.util.regex.Pattern;public class Main { private static Scanner cin; public static void main(String args[]) throws Exceptio...

import java.util.Scanner;public class Main{    private static Scanner cin;        public static void main(String args[])throws Exception {        cin = new Scanner(System.in);        int n = 0;...

大部分人都是倒着写的，按数字倒推需要多少个火柴，然后计算火柴数量，如果火柴数量多一些的话，遍历起来就比较费劲了。我的思路是正着计算，用两个for循环，通过遍历把火柴分成3份，每一份火柴计算出可能组成的数字序列，然后通过3个for循环遍历这些数字进行等式匹配，结合记忆搜索进行剪枝import java.util.HashMap;import java.util.Iterator;imp...

https://www.luogu.org/problemnew/show/P1056import java.util.Arrays;import java.util.Map.Entry;import java.util.Scanner;import java.util.TreeMap;public class Main { private static Scanner cin;...