結果
問題 | No.293 4>7の世界 |
ユーザー | holeguma |
提出日時 | 2015-10-23 22:34:24 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,396 bytes |
コンパイル時間 | 2,497 ms |
コンパイル使用メモリ | 79,488 KB |
実行使用メモリ | 50,540 KB |
最終ジャッジ日時 | 2024-07-22 23:09:36 |
合計ジャッジ時間 | 4,509 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 52 ms
36,952 KB |
testcase_01 | AC | 53 ms
37,192 KB |
testcase_02 | AC | 53 ms
37,216 KB |
testcase_03 | WA | - |
testcase_04 | AC | 50 ms
36,676 KB |
testcase_05 | AC | 51 ms
37,084 KB |
testcase_06 | AC | 50 ms
37,192 KB |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | AC | 50 ms
36,872 KB |
testcase_11 | AC | 50 ms
37,132 KB |
testcase_12 | AC | 50 ms
36,676 KB |
testcase_13 | WA | - |
testcase_14 | AC | 51 ms
37,100 KB |
testcase_15 | WA | - |
testcase_16 | AC | 52 ms
37,132 KB |
testcase_17 | AC | 51 ms
37,088 KB |
testcase_18 | AC | 51 ms
36,632 KB |
testcase_19 | AC | 49 ms
37,004 KB |
testcase_20 | AC | 52 ms
36,864 KB |
testcase_21 | AC | 51 ms
37,192 KB |
testcase_22 | AC | 54 ms
37,236 KB |
testcase_23 | WA | - |
ソースコード
import java.io.InputStream; import java.io.IOException; import java.io.PrintWriter; import java.util.ArrayList; import java.util.Arrays; import java.util.Comparator; import java.util.InputMismatchException; import java.util.NoSuchElementException; import java.math.BigDecimal; import java.math.BigInteger; public class Main{ static PrintWriter out; static InputReader ir; static final int INF=Integer.MAX_VALUE; static final long LINF=Long.MAX_VALUE; static void solve(){ String a=ir.next(); String b=ir.next(); if(a.length()!=b.length()){ if(a.length()>b.length()) out.println(a); else out.println(b); return; } for(int i=a.length()-1;i>=0;i--){ char na=a.charAt(i); char nb=b.charAt(i); if(na=='7'&&nb=='4'){ out.println(b); return; } if(nb=='7'&&na=='4'){ out.println(a); return; } if(na!=nb){ if(na>nb) out.println(a); else out.println(b); return; } } } public static void main(String[] args) throws Exception{ ir=new InputReader(System.in); out=new PrintWriter(System.out); solve(); out.flush(); } static class InputReader { private InputStream in; private byte[] buffer=new byte[1024]; private int curbuf; private int lenbuf; public InputReader(InputStream in) {this.in=in; this.curbuf=this.lenbuf=0;} public boolean hasNextByte() { if(curbuf>=lenbuf){ curbuf= 0; try{ lenbuf=in.read(buffer); }catch(IOException e) { throw new InputMismatchException(); } if(lenbuf<=0) return false; } return true; } private int readByte(){if(hasNextByte()) return buffer[curbuf++]; else return -1;} private boolean isSpaceChar(int c){return !(c>=33&&c<=126);} private void skip(){while(hasNextByte()&&isSpaceChar(buffer[curbuf])) curbuf++;} public boolean hasNext(){skip(); return hasNextByte();} public String next(){ if(!hasNext()) throw new NoSuchElementException(); StringBuilder sb=new StringBuilder(); int b=readByte(); while(!isSpaceChar(b)){ sb.appendCodePoint(b); b=readByte(); } return sb.toString(); } public int nextInt() { if(!hasNext()) throw new NoSuchElementException(); int c=readByte(); while (isSpaceChar(c)) c=readByte(); boolean minus=false; if (c=='-') { minus=true; c=readByte(); } int res=0; do{ if(c<'0'||c>'9') throw new InputMismatchException(); res=res*10+c-'0'; c=readByte(); }while(!isSpaceChar(c)); return (minus)?-res:res; } public long nextLong() { if(!hasNext()) throw new NoSuchElementException(); int c=readByte(); while (isSpaceChar(c)) c=readByte(); boolean minus=false; if (c=='-') { minus=true; c=readByte(); } long res = 0; do{ if(c<'0'||c>'9') throw new InputMismatchException(); res=res*10+c-'0'; c=readByte(); }while(!isSpaceChar(c)); return (minus)?-res:res; } public double nextDouble(){return Double.parseDouble(next());} public BigInteger nextBigInteger(){return new BigInteger(next());} public BigDecimal nextBigDecimal(){return new BigDecimal(next());} public int[] nextIntArray(int n){ int[] a=new int[n]; for(int i=0;i<n;i++) a[i]=nextInt(); return a; } public long[] nextLongArray(int n){ long[] a=new long[n]; for(int i=0;i<n;i++) a[i]=nextLong(); return a; } public char[][] nextCharMap(int n,int m){ char[][] map=new char[n][m]; for(int i=0;i<n;i++) map[i]=next().toCharArray(); return map; } } }