結果
問題 | No.1464 Number Conversion |
ユーザー | watarimaycry2 |
提出日時 | 2021-04-02 23:03:50 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,879 bytes |
コンパイル時間 | 5,204 ms |
コンパイル使用メモリ | 81,164 KB |
実行使用メモリ | 55,336 KB |
最終ジャッジ日時 | 2023-08-25 13:22:59 |
合計ジャッジ時間 | 7,819 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 45 ms
49,724 KB |
testcase_01 | AC | 87 ms
50,912 KB |
testcase_02 | AC | 66 ms
52,652 KB |
testcase_03 | AC | 43 ms
49,908 KB |
testcase_04 | AC | 62 ms
51,056 KB |
testcase_05 | AC | 64 ms
50,892 KB |
testcase_06 | AC | 62 ms
51,076 KB |
testcase_07 | AC | 63 ms
52,724 KB |
testcase_08 | WA | - |
testcase_09 | AC | 58 ms
51,052 KB |
testcase_10 | AC | 61 ms
50,624 KB |
testcase_11 | AC | 60 ms
51,140 KB |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | AC | 62 ms
52,880 KB |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | AC | 62 ms
51,080 KB |
testcase_21 | AC | 65 ms
53,068 KB |
testcase_22 | AC | 59 ms
50,828 KB |
testcase_23 | AC | 45 ms
49,780 KB |
testcase_24 | AC | 60 ms
51,016 KB |
testcase_25 | AC | 63 ms
52,596 KB |
testcase_26 | AC | 66 ms
52,724 KB |
testcase_27 | AC | 73 ms
51,468 KB |
testcase_28 | AC | 43 ms
49,692 KB |
ソースコード
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 String s = next(); if(!s.contains(".")){ myout(s + "/1"); return; } double N = Double.parseDouble(s); long fix = 1; while(N % 1 != 0){ fix *= 10; N *= 10; } long R = (long)N; while(true){ long g = gcd(R, fix); if(g != 1){ R /= g; fix /= g; }else{ break; } } myout(R + "/" + fix); } //Method addition frame start static long gcd(long m, long n) {return n != 0 ? gcd(n, m % n) : m;} //Method addition frame end }