結果
問題 |
No.327 アルファベット列
|
ユーザー |
![]() |
提出日時 | 2016-06-08 16:15:41 |
言語 | Java (openjdk 23) |
結果 |
RE
|
実行時間 | - |
コード長 | 512 bytes |
コンパイル時間 | 2,167 ms |
コンパイル使用メモリ | 76,496 KB |
実行使用メモリ | 41,688 KB |
最終ジャッジ日時 | 2024-10-09 03:06:42 |
合計ジャッジ時間 | 9,803 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 16 RE * 34 |
ソースコード
import java.util.Scanner; public class Main { public static void main (String[] args) { Scanner sc = new Scanner(System.in); System.out.println(solve(sc.nextInt())); sc.close(); } public static String solve (int n) { String[] alp = {"A","B","C","D","E","F","G","H","I","J","K","L","M","N","O","P","Q","R","S","T","U","V","W","X","Y","Z"}; String ret = alp[n % 26]; n /= 26; if (n == 0) return ret; while (n != 0) { ret = alp[n % 26 - 1] + ret; n /= 26; } return ret; } }