Submission #18862892
Source Code Expand
Copy
import java.io.*;import java.util.Arrays;import java.util.StringTokenizer;public class Main {// 注意不要用Arrays.sort()// 注意Math.pow可能导致精度问题// 注意int溢出问题static class Task {public void solve(int testNumber, InputReader in, PrintWriter out) {int n = in.nextInt();int m = in.nextInt();out.print(n / m);}}private static void sort(double[] arr) {Double[] objArr = Arrays.stream(arr).boxed().toArray(Double[]::new);Arrays.sort(objArr);
import java.io.*; import java.util.Arrays; import java.util.StringTokenizer; public class Main { // 注意不要用Arrays.sort() // 注意Math.pow可能导致精度问题 // 注意int溢出问题 static class Task { public void solve(int testNumber, InputReader in, PrintWriter out) { int n = in.nextInt(); int m = in.nextInt(); out.print(n / m); } } private static void sort(double[] arr) { Double[] objArr = Arrays.stream(arr).boxed().toArray(Double[]::new); Arrays.sort(objArr); for (int i = 0; i < arr.length; i++) { arr[i] = objArr[i]; } } private static void sortDesc(double[] arr) { Double[] objArr = Arrays.stream(arr).boxed().toArray(Double[]::new); Arrays.sort(objArr); for (int i = 0; i < arr.length; i++) { arr[i] = objArr[arr.length - i - 1]; } } private static void sort(int[] arr) { Integer[] objArr = Arrays.stream(arr).boxed().toArray(Integer[]::new); Arrays.sort(objArr); for (int i = 0; i < arr.length; i++) { arr[i] = objArr[i]; } } private static void sortDesc(int[] arr) { Integer[] objArr = Arrays.stream(arr).boxed().toArray(Integer[]::new); Arrays.sort(objArr); for (int i = 0; i < arr.length; i++) { arr[i] = objArr[arr.length - i - 1]; } } private static void sort(long[] arr) { Long[] objArr = Arrays.stream(arr).boxed().toArray(Long[]::new); Arrays.sort(objArr); for (int i = 0; i < arr.length; i++) { arr[i] = objArr[i]; } } private static void sortDesc(long[] arr) { Long[] objArr = Arrays.stream(arr).boxed().toArray(Long[]::new); Arrays.sort(objArr); for (int i = 0; i < arr.length; i++) { arr[i] = objArr[arr.length - i - 1]; } } private static void solve() { InputStream inputStream = System.in; OutputStream outputStream = System.out; InputReader in = new InputReader(inputStream); PrintWriter out = new PrintWriter(outputStream); Task task = new Task(); task.solve(1, in, out); out.close(); } public static void main(String[] args) { new Thread(null, () -> solve(), "1", 1 << 26).start(); } static class InputReader { public BufferedReader reader; public StringTokenizer tokenizer; public InputReader(InputStream stream) { reader = new BufferedReader(new InputStreamReader(stream), 32768); tokenizer = null; } public String next() { while (tokenizer == null || !tokenizer.hasMoreTokens()) { try { tokenizer = new StringTokenizer(reader.readLine()); } catch (IOException e) { throw new RuntimeException(e); } } return tokenizer.nextToken(); } public int nextInt() { return Integer.parseInt(next()); } public long nextLong() { return Long.parseLong(next()); } public double nextDouble() { return Double.parseDouble(next()); } } }
Submission Info
Submission Time | |
---|---|
Task | A - Brick |
User | yuruiyin |
Language | Java (OpenJDK 11.0.6) |
Score | 100 |
Code Size | 3451 Byte |
Status | AC |
Exec Time | 97 ms |
Memory | 33888 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt |
All | hand_01.txt, random_01.txt, random_02.txt, random_03.txt, random_04.txt, random_05.txt, random_06.txt, random_07.txt, random_08.txt, random_11.txt, random_12.txt, sample_01.txt, sample_02.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
hand_01.txt | AC | 97 ms | 33628 KB |
random_01.txt | AC | 89 ms | 33868 KB |
random_02.txt | AC | 80 ms | 33588 KB |
random_03.txt | AC | 86 ms | 33792 KB |
random_04.txt | AC | 85 ms | 33564 KB |
random_05.txt | AC | 87 ms | 33800 KB |
random_06.txt | AC | 84 ms | 33716 KB |
random_07.txt | AC | 86 ms | 33752 KB |
random_08.txt | AC | 84 ms | 33820 KB |
random_11.txt | AC | 91 ms | 33664 KB |
random_12.txt | AC | 79 ms | 33844 KB |
sample_01.txt | AC | 85 ms | 33860 KB |
sample_02.txt | AC | 76 ms | 33888 KB |