發表文章

目前顯示的是 10月, 2020的文章

UVA 11349 Java

import java.util.*; public class main{ public static void main(String[] args) { Scanner sc=new Scanner(System.in); int cases = sc.nextInt(); sc.nextLine(); for(int times = 0; times < cases; times++) { String[] str = sc.nextLine().split(" "); int lines = Integer.parseInt(str[str.length - 1]); int[] input = new int[lines * lines]; for(int i = 0; i < lines; i++) { String line = sc.nextLine().trim(); String[] temp =line.split(" "); for(int j = 0; j < temp.length; j++) input[i * lines + j] = Integer.parseInt(temp[j]); } boolean check = true; for(int i = 0; i < input.length / 2; i++) if(input[i] != input[input.length-1-i] || input[i] < 0) { check = false; break; } System.out.printf("Test #%d: %s\r\n", times + 1, check ? "Symmetric." : "Non-symmetric."); } } };

UVA 10812 Java

import java.util.*; 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 num1 = sc.nextInt(); int num2 = sc.nextInt(); int sum = num1 + num2; int dif = num1 - num2; if(sum < 0 || dif < 0 || sum % 2 != 0 && dif % 2 != 0) System.out.println("impossible"); else System.out.printf("%d %d\r\n", sum / 2, dif / 2); } } };

UVA 10170 Java

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()) { long p = sc.nextLong(); long d = sc.nextLong(); long s = p; while(s < d) s += ++p; System.out.println(p); } } };

UVA 10056 Java

import java.util.*; 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(); double p = sc.nextDouble(); int l = sc.nextInt(); System.out.printf("%.4f\r\n", p == 0 ? p : (p * Math.pow(1-p, l-1))/(1 - Math.pow(1-p, n))); } } };

UVA 12019 Java

import java.util.*; import static java.lang.System.*; public class main{ public static void main(String[] args) { Scanner sc=new Scanner(System.in); int[] mon = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31}; String[] days = {"Monday", "Tuesday", "Wednesday", "Thursday", "Friday", "Saturday", "Sunday"}; int cases = sc.nextInt(); for(int i =0; i < cases; i++) { int m = sc.nextInt(); int d = sc.nextInt(); d += 4; for(int j = 1; j < m; j++) d = d + mon[j-1]; System.out.println(days[d%7]); } } };

UVA 10252 Java

import java.util.*; public class main{ public static void main(String[] args) { Scanner sc=new Scanner(System.in); while(sc.hasNextLine()) { String str1 = sc.nextLine().toLowerCase(); String str2 = sc.nextLine().toLowerCase(); int[] count1 = new int[26]; int[] count2 = new int[26]; for(int i = 0; i < str1.length(); i++) { char c = str1.charAt(i); if(c>='a' && c <= 'z') count1[c - 'a']++; } for(int i = 0; i < str2.length(); i++) { char c = str2.charAt(i); if(c >= 'a' && c <= 'z') count2[c - 'a']++; } for(int i = 0; i < 26; i++) if(count1[i] != 0 && count2[i] != 0) { int min = Math.min(count1[i], count2[i]); for(int j = 0; j < min; j++) System.out.print((char)(i + 'a')); } System.out.println(); } } };

UVA 100 Java

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(); int max_n = Math.max(num1, num2); int min_n = Math.min(num1, num2); int max = 0; for(int i = min_n; i <= max_n; i++) { int n = i; int count = 1; while(n != 1) { count++; if(n%2 == 1) n=3*n+1; else n = n / 2; } if(count > max) max = count; } System.out.printf("%d %d %d\r\n", num1, num2, max); } } };

UVA 11063 Java

import java.util.*; public class main{ public static void main(String[] args) { Scanner sc=new Scanner(System.in); int cases = 0; while(sc.hasNextInt()) { int input = sc.nextInt(); if(input >= 2 && input <= 100) { cases++; int[] datas = new int[input]; List sum = new ArrayList (); for(int i = 0; i < input; i++) datas[i] = sc.nextInt(); boolean check = true; for(int i = 0; i < input; i++) for(int j = 0; j < input; j++) if(i <= j) { int temp = datas[i] + datas[j]; if(sum.indexOf(temp) == -1) sum.add(temp); else { check = false; break; } } if(check) System.out.printf("Case #%d: It is a B2-Sequence.\r\n", cases); else System.out.printf("Case #%d: It is not a B2-Sequence.\r\n", cases); } } } };

UVA 10101 Java

import java.util.*; public class main{ public static void main(String[] args) { Scanner sc=new Scanner(System.in); int count = 0; while(sc.hasNextLong()) { long num = sc.nextLong(); System.out.printf("%4d.", ++count); if(num == 0) System.out.print(" 0"); else bangla(num); System.out.println(); } } public static void bangla(long num) { if(num >= 10000000) { bangla(num / 10000000); System.out.print(" kuti"); num = num % 10000000; } if(num >= 100000) { bangla(num / 100000); System.out.print(" lakh"); num = num % 100000; } if(num >= 1000) { bangla(num / 1000); System.out.print(" hajar"); num = num % 1000; } if(num >= 100) { bangla(num / 100); System.out.print(" shata"); num = num % 100; } if(num > 0) System.out

UVA 272 Java

import java.util.*; public class main{ public static void main(String[] args) { Scanner sc=new Scanner(System.in); boolean check = true; while(sc.hasNextLine()) { String str = sc.nextLine(); for(int i=0; i < str.length(); i++) { char c = str.charAt(i); if(c == '\"') { System.out.print(check ? "``" : "\'\'"); check = !check; } else System.out.print(c); } System.out.println(); } } };

UVA 11332 Java

import java.util.*; public class main{ public static void main(String[] args) { Scanner sc=new Scanner(System.in); while(sc.hasNextLine()) { String str = sc.nextLine(); if(str.equals("0")) break; while(str.length() > 1) { int num = 0; for(int i = 0; i < str.length(); i++) num += str.charAt(i) - '0'; str = Integer.toString(num); } System.out.println(str); } } }; import java.util.*; public class main{ public static void main(String[] args) { Scanner sc=new Scanner(System.in); while(sc.hasNextLine()) { int num = Integer.parseInt(sc.nextLine()); if(num == 0) break; while(num >= 10) { int temp = 0; while(num != 0) { temp += num % 10; num /= 10; } num = temp; } System.out.println(num); } } };

UVA 490 Java

import java.util.*; import static java.lang.System.*; public class main{ public static void main(String[] args) { Scanner sc=new Scanner(System.in); int max = 0; List inputs = new ArrayList (); while(sc.hasNextLine()) { String str = sc.nextLine(); if(str.length() > max) max = str.length(); inputs.add(str); } Collections.reverse(inputs); for(int j = 0; j < max; j++) { int count = 0; for(int i = 0; i < inputs.size(); i++) { String str = inputs.get(i); if(j < str.length()) { while(count > 0) { System.out.print(" "); count--; } System.out.print(str.charAt(j)); count = 0; } else count++; } System.out.println(); } } };

UVA 10019 Java

import java.util.*; import static java.lang.System.*; public class main{ public static void main(String[] args) { Scanner sc=new Scanner(System.in); int lines = sc.nextInt(); for(int i =0; i < lines; i++) { String input = Integer.toString(sc.nextInt()); String bin_str = Integer.toBinaryString(Integer.parseInt(input)); int count1 = 0; for(int j = 0; j < bin_str.length(); j++) if(bin_str.charAt(j) == '1') count1 ++; String hex_to_dec_str = Integer.toBinaryString(Integer.parseInt(input, 16)); int count2 = 0; for(int j = 0; j < hex_to_dec_str.length(); j++) if(hex_to_dec_str.charAt(j) == '1') count2 ++; System.out.println(String.format("%d %d", count1, count2)); } } };

UVA 10035 Java

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 num1 = sc.nextInt(); int num2 = sc.nextInt(); if(num1 == 0 && num2 ==0) break; else { int count = 0; int temp = 0; while(num1 != 0 || num2 !=0) { int n1 = num1 % 10; int n2 = num2 % 10; temp = temp + n1 + n2; if(temp >= 10) count ++; temp /= 10; num1 /= 10; num2 /= 10; } if(count == 0) System.out.println("No carry operation."); else if(count == 1) System.out.println("1 carry operation."); else System.out.println(String.format("%d carry operations.", count)); } } } };

UVA 10008 Java

import java.util.*; public class main{ public static void main(String[] args) { Scanner sc=new Scanner(System.in); int lines = sc.nextInt(); sc.nextLine(); int[] count = new int[26]; int max = 0; for(int i = 0; i < lines; i++) { String str = sc.nextLine().toLowerCase(); for(int j = 0; j < str.length(); j++) { char ch = str.charAt(j); if(ch >= 97 && ch <= 122) if(++count[ch - 97] > max) max = count[ch - 97]; } } for(int i = max; i > 0; i--) for(int j = 0; j < 26; j++) if(i == count[j]) System.out.println(String.format("%c %d", (char)(j + 65), i)); } };

UVA 10420 Java

import java.util.*; public class main{ public static void main(String[] args) { Scanner sc=new Scanner(System.in); int lines = sc.nextInt(); sc.nextLine(); String[] datas = new String[lines]; for(int i = 0; i < lines; i++) { String[] str = sc.nextLine().split(" "); datas[i] = str[0]; } Arrays.sort(datas); for(int i = 0; i < lines; i++) { String search = datas[i]; int count = 0; for(int j = i; j < lines; j++) { if(datas[j].equals(search)) { count ++; i = j; } else break; } System.out.println(String.format("%s %d", search, count)); } } };

UVA 10222 Java

import java.util.*; public class main{ public static void main(String[] args) { Scanner sc=new Scanner(System.in); String decode = "qwertyuiop[]asdfghjkl;'zxcvbnm,./"; while(sc.hasNextLine()) { String str = sc.nextLine().toLowerCase(); for(int i = 0; i < str.length(); i++) { char c = str.charAt(i); int index = decode.indexOf(c) - 2; if(c == ' ') System.out.print(" "); else System.out.print(decode.charAt(index)); } System.out.println(); } } };

UVA 10038 Java

import static java.lang.System.*; public class main{ public static void main(String[] args) { Scanner sc=new Scanner(System.in); while(sc.hasNextInt()) { int size = sc.nextInt(); boolean is_jolly = true; if(size != 1) { int[] input = new int[size]; for(int i = 0; i < size; i++) input[i] = sc.nextInt(); int[] dif = new int[size -1]; for(int i = 0; i < size-1; i++) dif[i] = Math.abs(input[i+1] - input[i]); Arrays.sort(dif); for(int i = 0; i < size-1; i++) if(dif[i] != i+1) { is_jolly = false; break; } } else sc.nextInt(); if(is_jolly) System.out.println("Jolly"); else System.out.println("Not jolly"); } } };

UVA 11150 Java

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(); System.out.println(n + n / 2); } } };

UVA 10783 Java

import java.util.*; public class main{ public static void main(String[] args) { Scanner sc = new Scanner(System.in); int times = sc.nextInt(); for(int i = 0; i < times; i++) { int a = sc.nextInt(); int b = sc.nextInt(); int sum = 0; for(int j = a; j <= b; j++) if(j % 2 != 0) sum += j; System.out.println(String.format("Case %d: %d", i+1, sum)); } } };

UVA 10268 Java

import java.util.*; public class main{ public static void main(String[] args) { Scanner sc = new Scanner(System.in); while(sc.hasNextLine()) { int x = Integer.parseInt(sc.nextLine()); String[] str = sc.nextLine().split(" "); //System.out.println(x); int output = 0; for(int i = 0; i < str.length - 1; i++) { int n = Integer.parseInt(str[i]); output += n * Math.pow(x, str.length -2 -i) * (str.length -1 -i); } System.out.println(output); } } };

UVA 10929 Java

import java.util.*; public class main{ public static void main(String[] args) { Scanner sc = new Scanner(System.in); while(sc.hasNextLine()) { String str = sc.nextLine(); if(str.equals("0")) return; int odd=0, even=0; for(int i = 0; i < str.length(); i++) { if(i % 2 == 0) //even += Integer.parseInt(String.valueOf(str.charAt(i))); even += str.charAt(i) - 48; else //odd += Integer.parseInt(String.valueOf(str.charAt(i))); odd += str.charAt(i) - 48; } if(Math.abs(odd-even)%11 == 0) System.out.println(str + " is a multiple of 11."); else System.out.println(str + " is not a multiple of 11."); } } };

UVA 10055 Java

import java.util.*; public class main{ public static void main(String[] args) { Scanner sc = new Scanner(System.in); while(sc.hasNext()) { long n1 = sc.nextLong(); long n2 = sc.nextLong(); System.out.println(Math.abs(n1 - n2)); } } };

UVA 10041 Java

import java.util.*; public class main{ public static void main(String[] args) { Scanner sc = new Scanner(System.in); int times = sc.nextInt(); for(int i = 0; i < times; i++) { int count = sc.nextInt(); int[] datas = new int[count]; for(int j = 0; j < count; j++) datas[j] = sc.nextInt(); Arrays.sort(datas); int len = 0; for(int j = 0; j < count; j++) len += Math.abs(datas[j] - datas[j/2]); System.out.println(len); } } };