結果
問題 | No.1423 Triangle of Multiples |
ユーザー |
![]() |
提出日時 | 2021-03-12 21:34:23 |
言語 | Java (openjdk 23) |
結果 |
AC
|
実行時間 | 450 ms / 2,000 ms |
コード長 | 3,264 bytes |
コンパイル時間 | 2,917 ms |
コンパイル使用メモリ | 89,816 KB |
実行使用メモリ | 52,844 KB |
最終ジャッジ日時 | 2024-10-14 11:45:15 |
合計ジャッジ時間 | 5,067 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 4 |
ソースコード
import java.util.*; import java.io.*; import java.math.*; public class Main{ //Don't have to see. start------------------------------------------ static class InputIterator{ ArrayList<String> inputLine = new ArrayList<>(1024); int index = 0; int max; String read; InputIterator(){ BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); try{ while((read = br.readLine()) != null){ inputLine.addAll(Arrays.asList(read.split(" "))); } }catch(IOException e){} max = inputLine.size(); } boolean hasNext(){return (index < max);} String next(){ if(hasNext()){ return inputLine.get(index++); }else{ throw new IndexOutOfBoundsException("There is no more input"); } } } static HashMap<Integer, String> CONVSTR = new HashMap<>(); static InputIterator ii = new InputIterator();//This class cannot be used in reactive problem. static PrintWriter out = new PrintWriter(System.out); static void flush(){out.flush();} static void myout(Object t){out.println(t);} static void myerr(Object t){System.err.print("debug:");System.err.println(t);} static String next(){return ii.next();} static boolean hasNext(){return ii.hasNext();} static int nextInt(){return Integer.parseInt(next());} static long nextLong(){return Long.parseLong(next());} static double nextDouble(){return Double.parseDouble(next());} static ArrayList<String> nextCharArray(){return myconv(next(), 0);} static ArrayList<String> nextStrArray(int size){ ArrayList<String> ret = new ArrayList<>(size); for(int i = 0; i < size; i++){ ret.add(next()); } return ret; } static ArrayList<Integer> nextIntArray(int size){ ArrayList<Integer> ret = new ArrayList<>(size); for(int i = 0; i < size; i++){ ret.add(Integer.parseInt(next())); } return ret; } static ArrayList<Long> nextLongArray(int size){ ArrayList<Long> ret = new ArrayList<>(size); for(int i = 0; i < size; i++){ ret.add(Long.parseLong(next())); } return ret; } @SuppressWarnings("unchecked") static String myconv(Object list, int no){//only join String joinString = CONVSTR.get(no); if(list instanceof String[]){ return String.join(joinString, (String[])list); }else if(list instanceof ArrayList){ return String.join(joinString, (ArrayList)list); }else{ throw new ClassCastException("Don't join"); } } static ArrayList<String> myconv(String str, int no){//only split String splitString = CONVSTR.get(no); return new ArrayList<String>(Arrays.asList(str.split(splitString))); } public static void main(String[] args){ CONVSTR.put(8, " "); CONVSTR.put(9, "\n"); CONVSTR.put(0, ""); solve();flush(); } //Don't have to see. end------------------------------------------ static void solve(){//Here is the main function int t = nextInt(); for(int i = 0; i < t; i++){ ArrayList<Long> tmp = nextLongArray(3); Collections.sort(tmp); long A = tmp.get(0); long B = tmp.get(1); long C = tmp.get(2); long L = lcm(A, lcm(B, C)); myout(L + " " + L + " " + L); } } //Method addition frame start static long lcm(long m, long n) {return Math.max(m,n) / gcd(m, n) * Math.min(m,n);} static long gcd(long m, long n) {return n != 0 ? gcd(n, m % n) : m;} //Method addition frame end }