結果
| 問題 |
No.164 ちっちゃくないよ!!
|
| コンテスト | |
| ユーザー |
t8m8⛄️
|
| 提出日時 | 2015-03-13 00:14:59 |
| 言語 | Java (openjdk 23) |
| 結果 |
AC
|
| 実行時間 | 152 ms / 2,000 ms |
| コード長 | 4,848 bytes |
| コンパイル時間 | 4,246 ms |
| コンパイル使用メモリ | 79,712 KB |
| 実行使用メモリ | 44,408 KB |
| 最終ジャッジ日時 | 2024-10-13 14:10:52 |
| 合計ジャッジ時間 | 5,621 ms |
|
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
| ファイルパターン | 結果 |
|---|---|
| other | AC * 11 |
ソースコード
import java.util.*;
import java.io.*;
import java.math.*;
import static java.util.Arrays.*;
import static java.lang.Math.*;
public class No164 {
static final InputStream in = System.in;
static final PrintWriter out = new PrintWriter(System.out,false);
static void solve(){
int n = nextInt();
String[] ss = {"10","11","12","13","14","15","16","17","18","19","20","21","22",
"23","24","25","26","27","28","29","30","31","32","33","34","35","36"};
String[] input = new String[n];
int[] max = new int[n];
for (int i=0; i<n; i++) {
input[i] = next();
for (int j=0; j<input[i].length(); j++) {
max[i] = max(max[i],input[i].charAt(j));
}
}
BigInteger d;
if ('0' <= max[0] && max[0] <= '9') {
d = new BigInteger(((Integer)(max[0]-'0'+1)).toString());
}else {
d = new BigInteger(ss[max[0]-'A'+1]);
}
BigInteger ans = BigInteger.ZERO;
for (int j=input[0].length()-1,k=0; j>=0; j--,k++) {
Character c = input[0].charAt(j);
ans = ans.add(d.pow(k).multiply(new BigInteger('0' <= c && c <= '9' ? c.toString() : ss[c-'A'])));
}
for (int i=1; i<n; i++) {
if ('0' <= max[i] && max[i] <= '9') {
d = new BigInteger(((Integer)(max[i]-'0'+1)).toString());
}else {
d = new BigInteger(ss[max[i]-'A'+1]);
}
BigInteger t = BigInteger.ZERO;
for (int j=input[i].length()-1,k=0; j>=0; j--,k++) {
Character c = input[i].charAt(j);
t = t.add(d.pow(k).multiply(new BigInteger('0' <= c && c <= '9' ? c.toString() : ss[c-'A'])));
}
ans = ans.min(t);
}
out.println(ans);
}
public static void main(String[] args) throws Exception {
long start = System.currentTimeMillis();
solve();
out.flush();
long end = System.currentTimeMillis();
//trace(end-start + "ms");
in.close();
}
static void trace(Object... o) { System.out.println(deepToString(o));}
static final byte[] buf = new byte[1024];
static int ptr = 0;
static int buflen = 0;
static boolean hasNextByte() {
if (ptr < buflen)
return true;
ptr = 0;
try{
buflen = in.read(buf);
}catch (IOException e) {e.printStackTrace();}
if (buflen <= 0)
return false;
return true;
}
static int readByte() { if (hasNextByte()) return buf[ptr++]; else return -1;}
static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
static void skip() { while(hasNextByte() && !isPrintableChar(buf[ptr])) ptr++;}
static boolean hasNext() {skip(); return hasNextByte();}
static String next() {
if (!hasNext()) throw new NoSuchElementException();
StringBuilder sb = new StringBuilder();
int b = readByte();
while (isPrintableChar(b)) {
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
static long nextLong() {
if (!hasNext()) throw new NoSuchElementException();
boolean minus = false;
long num = readByte();
if(num == '-'){
num = 0;
minus = true;
}else if (num < '0' || '9' < num){
throw new NumberFormatException();
}else{
num -= '0';
}
while(true){
int b = readByte();
if('0' <= b && b <= '9')
num = num * 10 + (b - '0');
else if(b == -1 || !isPrintableChar(b))
return minus ? -num : num;
else
throw new NoSuchElementException();
}
}
static int nextInt() {
long num = nextLong();
if (num < Integer.MIN_VALUE || Integer.MAX_VALUE < num)
throw new NumberFormatException();
return (int)num;
}
static double nextDouble() {
return Double.parseDouble(next());
}
static char nextChar() {
if (!hasNext()) throw new NoSuchElementException();
return (char)readByte();
}
static String nextLine() {
while (hasNextByte() && (buf[ptr] == '\n' || buf[ptr] == '\r')) ptr++;
if (!hasNextByte()) throw new NoSuchElementException();
StringBuilder sb = new StringBuilder();
int b = readByte();
while (b != '\n' && b != '\r') {
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
static int[] nextArrayInt(int n) {
int[] a = new int[n];
for (int i=0; i<n; i++) a[i] = nextInt();
return a;
}
}
t8m8⛄️