純粹紀錄@Dragonyue

import java.util.*; import static java.lang.System.*; public class main{ public static void main(String[] args) { Scanner sc=new Scanner(System.in); while(sc.hasNextInt()) { int num = sc.nextInt(); int m = sc.nextInt(); System.out.printf("%d %d\r\n", num, m); if(num == 0&& m == 0) break; Data[] datas = new Data[num]; for(int i = 0; i < num; i++) { int n = sc.nextInt(); datas[i] = new Data(n, n % m, n % 2 == 0); } Arrays.sort(datas); for(int i = 0; i < num; i++) { System.out.println(datas[i].toString()); } } } public static class Data implements Comparable { int n; int r; boolean even; Data(int n, int r, boolean even) { this.n = n; this.r = r; this.even = even; } public String toString() { return Integer.toString(this.n); } @Override public int compareTo(Data other) { if(this.r != other.r) return this.r < other.r ? -1 : 1

import java.util.*; import static java.lang.System.*; public class main{ public static void main(String[] args) { Scanner sc=new Scanner(System.in); int w = sc.nextInt(), h = sc.nextInt(); boolean drop_loc[][] = new boolean[51][51]; while(sc.hasNext()) { int x = sc.nextInt(), y = sc.nextInt(); char ori = sc.next().charAt(0); String cmd = sc.next(); boolean drop = false; for(int i = 0; i < cmd.length(); i++) { char c = cmd.charAt(i); int tempx = x; int tempy = y; if(c == 'L') { if(ori == 'N') ori = 'W'; else if(ori == 'E') ori = 'N'; else if(ori == 'S') ori = 'E'; else if(ori == 'W') ori = 'S'; } else if(c == 'R') { if(ori == 'N') ori = 'E'; else if(ori == 'E') ori = 'S'; else i

import java.util.*; import static java.lang.System.*; public class main{ public static void main(String[] args) { Scanner sc=new Scanner(System.in); int cases = sc.nextInt(); for(int t = 0; t < cases; t++) { String finger[] = {"c0111001111", "d0111001110", "e0111001100", "f0111001000", "g0111000000", "a0110000000", "b0100000000", "C0010000000", "D1111001110", "E1111001100", "F1111001000", "G1111000000", "A1110000000", "B1100000000"}; String current = "00000000000"; String cmd = sc.next(); int[] count = new int[10]; for(int index = 0; index < cmd.length(); index++) { char c = cmd.charAt(index); for(int i = 0; i < 14; i++) { if(finger[i].charAt(0) == c) { String temp = finger[i]; for(int j = 1; j < 11; j++) { if(current.charAt(j)

import java.util.*; import static java.lang.System.*; public class main{ public static void main(String[] args) { Scanner sc=new Scanner(System.in); while(sc.hasNextInt()) { int num = sc.nextInt(); if(num == 0) break; int top = 1, n = 2, w = 3, s = 5, e = 4; for(int i = 0; i < num; i++) { String cmd = sc.next(); if(cmd.equals("north")) { n = top; top = s; s = 7 - n; } else if(cmd.equals("east")) { e = top; top = w; w = 7 - e; } else if(cmd.equals("south")) { s = top; top = n; n = 7 - s; } else if(cmd.equals("west")) { w = top; top = e; e = 7 - w; } } System.out.println(top); } } };

import java.util.*; import static java.lang.System.*; public class main{ public static void main(String[] args) { Scanner sc=new Scanner(System.in); int t = 0, h = 0, w =0; while(sc.hasNextInt()) { h = sc.nextInt(); w = sc.nextInt(); if(h == 0 || w == 0) break; if(t != 0) System.out.println(); System.out.printf("Field #%d:\r\n", ++t); char[][] map = new char[h][w]; for(int i = 0; i < h; i++) { String str = sc.next(); for(int j = 0; j < w; j++) map[i][j] = str.charAt(j); } for(int i = 0; i < h; i++) { for(int j = 0; j < w; j++) { int count = 0; if(map[i][j] == '*') System.out.print("*"); else { if( i - 1 >= 0 && map[i - 1][j] == '*') count++; if( i + 1 < h && map[i + 1][j] == '*') count++; if( j - 1 >= 0 &&

import java.util.*; import static java.lang.System.*; public class main{ public static void main(String[] args) { Scanner sc=new Scanner(System.in); while(sc.hasNextInt()) { int n = sc.nextInt(); int[] datas = new int[n]; for(int i = 0; i < n; i++) datas[i] = sc.nextInt(); Arrays.sort(datas); int mid = datas[(n - 1) / 2]; int mid2 = datas[n / 2]; int count = 0; for(int i = 0; i < n; i++) if(datas[i] == mid || datas[i] == mid2) count++; System.out.printf("%d %d %d\r\n", mid, count, mid2 - mid + 1); } } };

import java.util.*; import static java.lang.System.*; public class main{ public static void main(String[] args) { Scanner sc=new Scanner(System.in); while(sc.hasNextDouble()) { double[] px = new double[4]; double[] py = new double[4]; double x = 0, y = 0; for(int i = 0; i < 4; i++) { px[i] = sc.nextDouble(); py[i] = sc.nextDouble(); x += px[i]; y += py[i]; } for(int i = 0; i < 4; i++) for(int j = i + 1; j < 4; j++) if(px[i] == px[j] && py[i] == py[j]) { System.out.printf("%.3f %.3f\r\n", x - px[i] * 3, y - py[i] * 3); i = j = 4; } } } };

import java.util.*; import static java.lang.System.*; public class main{ public static void main(String[] args) { Scanner sc=new Scanner(System.in); int cases = sc.nextInt(); for(int t = 0; t < cases; t++) { int n = sc.nextInt(); int[] datas = new int[n]; for(int i = 0; i < n; i++) datas[i] = sc.nextInt(); int count = 0; for(int i = 0; i < n-1; i++) for(int j = 0; j < n-1; j++) { if(datas[j] > datas[j+1]) { int temp = datas[j+1]; datas[j+1] = datas[j]; datas[j] = temp; count++; } } System.out.printf("Optimal train swapping takes %d swaps.\r\n", count); } } };

import java.util.*; import static java.lang.System.*; public class main{ public static void main(String[] args) { Scanner sc=new Scanner(System.in); int r = 6440; while(sc.hasNextInt()) { double s = (double)sc.nextInt(); double a = (double)sc.nextInt(); String str = sc.next(); if(str.equals("deg")) a = Math.min(360-a, a); else a /= 60; double arc= 2*Math.PI*(s+r)*a/360; double chord = Math.sqrt(2*Math.pow(s+r, 2)*(1-Math.cos(a*Math.PI/180))); System.out.printf("%.6f %.6f\r\n", arc, chord); } } };

import java.util.*; import static java.lang.System.*; public class main{ public static void main(String[] args) { Scanner sc=new Scanner(System.in); int cases = sc.nextInt(); for(int t = 0; t < cases; t++) { int m = sc.nextInt(); int n = sc.nextInt(); int q = sc.nextInt(); System.out.printf("%d %d %d\r\n", m, n, q); char[][] datas = new char[m][n]; for(int i = 0; i < m; i++) { String str = sc.next(); for(int j = 0; j < n; j++) datas[i][j] = str.charAt(j); } for(int k = 0; k < q; k++) { int x1 = sc.nextInt(); int y1 = sc.nextInt(); int i; for(i = 0; i < m; i++) { boolean flag = true; for(int x = x1 - i; x <= x1 + i; x++) { for(int y = y1 - i; y <= y1 + i; y++) { if(x < 0 || y < 0 || x >= m || y >= n || datas[x][y] != datas[x1][y1]) { flag = false; break;

import java.util.*; import static java.lang.System.*; public class main{ public static void main(String[] args) { Scanner sc=new Scanner(System.in); while(sc.hasNextLine()) { String input = sc.nextLine(); if(input.equals("0")) break; String str = input; int count = str.equals("9") ? 1 : 0; while(str.length() != 1) { int sum = 0; for(int i = 0; i < str.length(); i++) sum += str.charAt(i) - '0'; if(sum % 9 == 0) count ++; else break; str = Integer.toString(sum); } if(count > 0) System.out.printf("%s is a multiple of 9 and has 9-degree %d.\r\n", input, count); else System.out.printf("%s is not a multiple of 9.\r\n", input); } } };

import java.util.*; import static java.lang.System.*; public class main{ public static void main(String[] args) { Scanner sc=new Scanner(System.in); while(sc.hasNextLong()) { long n = sc.nextLong(); long m = sc.nextLong(); boolean flag = m == 1 ? false : true; List num = new ArrayList (); while(flag) { num.add(n); if(n == 1) break; else if(n % m == 0) n /= m; else { flag = false; break; } } if(flag) { for(int i = 0; i < num.size(); i++) { System.out.print(num.get(i)); if(i != num.size() - 1) System.out.print(" "); } System.out.println(); } else System.out.println("Boring!"); } } };

import java.util.*; import static java.lang.System.*; public class main{ public static void main(String[] args) { Scanner sc=new Scanner(System.in); int cases = sc.nextInt(); for(int t = 0; t < cases; t++) { int n = sc.nextInt(); int h = sc.nextInt(); int[] party = new int[h]; for(int i = 0; i < h; i++) party[i] = sc.nextInt(); int count = 0; for(int i = 1; i < n + 1; i++) { boolean flag = false; for(int j = 0; j < h; j++) if(i % party[j] == 0) flag = true; if(flag && i % 7 != 0 && i % 7 != 6) count++; } System.out.println(count); } } };

import java.util.*; import static java.lang.System.*; public class main{ public static void main(String[] args) { Scanner sc=new Scanner(System.in); int cases = sc.nextInt(); for(int i = cases; i > 0; i--) { System.out.printf("Case %d:\r\n", cases -i +1); int[] bases = new int[36]; for(int j = 0; j < 36; j++) bases[j] = sc.nextInt(); int changes = sc.nextInt(); for(int k = 0; k < changes; k++) { int min = Integer.MAX_VALUE; int num = sc.nextInt(); int[] total = new int[37]; for(int j = 2; j < 37; j++) { int numtemp = num; while(numtemp > 0) { int temp = numtemp % j; numtemp /= j; total[j] += bases[temp]; } if(total[j] < min) min = total[j]; } System.out.printf("Cheapest base(s) for number %d:", num); for(int j=2; j < 37; j++) if(min == total[j]) System.out.print("

import java.util.*; import static java.lang.System.*; public class main{ public static void main(String[] args) { Scanner sc=new Scanner(System.in); int newline = 0; while(sc.hasNextLine()) { String str = sc.nextLine(); if(newline++ !=0) System.out.println(); int[] freq = new int[127]; int max = 0; for(int i = 0; i < str.length(); i++) { char c = str.charAt(i); if(++freq[c] > max) max = freq[c]; } for(int i = 1; i <= max; i++) for(int j = 126; j >= 0; j--) if(freq[j] == i) System.out.printf("%d %d\r\n", j, i); } } };

import java.util.*; import static java.lang.System.*; public class main{ public static void main(String[] args) { Scanner sc=new Scanner(System.in); int num; while((num = sc.nextInt()) != 0) { int gcd = 0; for(int i = 1; i < num; i++) for(int j = i+1; j <= num; j++) { int num1 = i, num2 = j; while(num2 != 0) { int temp = num2; num2 = num1 % num2; num1 = temp; } gcd += num1; } System.out.println(gcd); } } };

import java.util.*; import static java.lang.System.*; public class main{ public static void main(String[] args) { Scanner sc=new Scanner(System.in); int cases = Integer.parseInt(sc.nextLine()); for(int i = 0; i < cases; i++) { int num1 = Integer.parseInt(sc.nextLine(), 2); int num2 = Integer.parseInt(sc.nextLine(), 2); while(num2 != 0) { int temp = num2; num2 = num1 % num2; num1 = temp; } if(num1 != 1) System.out.printf("Pair #%d: All you need is love!\r\n", i + 1); else System.out.printf("Pair #%d: Love is not all you need!\r\n", i + 1); } } };

import java.util.*; import static java.lang.System.*; public class main{ public static void main(String[] args) { Scanner sc=new Scanner(System.in); while(sc.hasNextInt()) { int n = sc.nextInt(); if(n == 0) break; String str = Integer.toBinaryString(n); int count = 0; for(int i = 0; i < str.length(); i++) if(str.charAt(i) == '1') count++; System.out.printf("The parity of %s is %d (mod 2).\r\n", str, count); } } };

import java.util.*; import static java.lang.System.*; public class main{ public static void main(String[] args) { Scanner sc=new Scanner(System.in); int cases = sc.nextInt(); for(int i = 0; i < cases; i++) { int n = sc.nextInt(); List fib = new ArrayList (); fib.add(1); if(n > 1) { fib.add(2); int temp = fib.get(fib.size()-1) + fib.get(fib.size()-2); while(temp <= n) { fib.add(temp); temp = fib.get(fib.size()-1) + fib.get(fib.size()-2); } } String str = String.format("%d = ", n); for(int j = fib.size() - 1; j >= 0; j--) { if(n >= fib.get(j)) { str+="1"; n -= fib.get(j); } else str += "0"; } System.out.printf("%s (fib)\r\n", str); } } };

import java.util.*; import static java.lang.System.*; public class main{ public static void main(String[] args) { Scanner sc=new Scanner(System.in); while(sc.hasNextInt()) { int v = sc.nextInt(); int t = sc.nextInt(); System.out.println(v * t * 2); } } };

import java.util.*; import static java.lang.System.*; public class main{ public static void main(String[] args) { Scanner sc=new Scanner(System.in); while(sc.hasNextLine()) { String str = sc.nextLine(); int sum = 0; int max = 1; int r = 0; for(int i =0; i < str.length(); i++) { char c = str.charAt(i); if(c >= '0' && c <= '9') r = c - '0'; else if(c >= 'A' && c <= 'Z') r = c - 'A' + 10; else if(c >= 'a' && c <= 'z') r = c - 'a' + 36; sum += r; if(r > max) max = r; } for(int i = max; i <= 62; i++) { if(sum % i == 0) { System.out.println(i+1); break; } else if(i == 62) System.out.println("such number is impossible!"); } } } };

import java.util.*; public class main{ public static void main(String[] args) { Scanner sc=new Scanner(System.in); while(sc.hasNextInt()) { int num1 = sc.nextInt(); int num2 = sc.nextInt(); if(num1 == num2 && num1 == 0) break; int count = (int)Math.sqrt(num2) - (int)Math.ceil(Math.sqrt(num1)) + 1; System.out.println(count); } } };

import java.util.*; import static java.lang.System.*; public class main{ public static void main(String[] args) { Scanner sc=new Scanner(System.in); while(sc.hasNextInt()) { int n = sc.nextInt(); boolean P_n = checkPrime(n); String str = Integer.toString(n); int n2 = 0; for(int i = 0; i < str.length();i++) n2 += (str.charAt(i) - '0') * Math.pow(10, i); boolean P_n2 = checkPrime(n2); if(!P_n) System.out.printf("%d is not prime.\r\n", n); else if(P_n && ! P_n2 || n == n2) System.out.printf("%d is prime.\r\n", n); else System.out.printf("%d is emirp.\r\n", n); } } public static boolean checkPrime(int num) { for(int i = 2; i <= num / 2; i++) if(num % i == 0) return false; return true; } };