結果
問題 | No.176 2種類の切手 |
ユーザー | holeguma |
提出日時 | 2015-10-13 17:10:25 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,307 bytes |
コンパイル時間 | 2,568 ms |
コンパイル使用メモリ | 86,116 KB |
実行使用メモリ | 58,688 KB |
最終ジャッジ日時 | 2024-10-08 03:35:42 |
合計ジャッジ時間 | 5,249 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | WA | - |
testcase_01 | TLE | - |
testcase_02 | -- | - |
testcase_03 | -- | - |
testcase_04 | -- | - |
testcase_05 | -- | - |
testcase_06 | -- | - |
testcase_07 | -- | - |
testcase_08 | -- | - |
testcase_09 | -- | - |
testcase_10 | -- | - |
testcase_11 | -- | - |
testcase_12 | -- | - |
testcase_13 | -- | - |
testcase_14 | -- | - |
testcase_15 | -- | - |
testcase_16 | -- | - |
testcase_17 | -- | - |
testcase_18 | -- | - |
testcase_19 | -- | - |
testcase_20 | -- | - |
testcase_21 | -- | - |
testcase_22 | -- | - |
testcase_23 | -- | - |
testcase_24 | -- | - |
testcase_25 | -- | - |
testcase_26 | -- | - |
testcase_27 | -- | - |
testcase_28 | -- | - |
testcase_29 | -- | - |
testcase_30 | -- | - |
testcase_31 | -- | - |
ソースコード
import java.io.InputStream;import java.io.IOException;import java.io.PrintWriter;import java.util.ArrayDeque;import java.util.ArrayList;import java.util.Arrays;import java.util.BitSet;import java.util.Comparator;import java.util.Collections;import java.util.Deque;import java.util.HashMap;import java.util.HashSet;import java.util.InputMismatchException;import java.util.Map;import java.util.NoSuchElementException;import java.util.PriorityQueue;import java.util.TreeMap;import java.util.TreeSet;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(){int a=ir.nextInt();int b=ir.nextInt();int t=ir.nextInt();long ans=LINF;for(int i=0;;i++){int j=(t-a*i+b-1)/b;if(a*i>t) break;ans=Math.min(ans,a*i+b*j);}out.println(ans);}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 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;}}}