結果
問題 | No.528 10^9と10^9+7と回文 |
ユーザー | uwi |
提出日時 | 2017-06-09 22:42:35 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 241 ms / 1,000 ms |
コード長 | 3,914 bytes |
コンパイル時間 | 4,264 ms |
コンパイル使用メモリ | 78,448 KB |
実行使用メモリ | 52,504 KB |
最終ジャッジ日時 | 2023-10-01 00:53:28 |
合計ジャッジ時間 | 8,831 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge14 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 42 ms
49,708 KB |
testcase_01 | AC | 41 ms
49,172 KB |
testcase_02 | AC | 42 ms
49,488 KB |
testcase_03 | AC | 42 ms
49,476 KB |
testcase_04 | AC | 42 ms
49,392 KB |
testcase_05 | AC | 43 ms
49,332 KB |
testcase_06 | AC | 44 ms
49,688 KB |
testcase_07 | AC | 43 ms
49,480 KB |
testcase_08 | AC | 43 ms
49,380 KB |
testcase_09 | AC | 42 ms
49,368 KB |
testcase_10 | AC | 240 ms
52,164 KB |
testcase_11 | AC | 240 ms
52,300 KB |
testcase_12 | AC | 241 ms
52,164 KB |
testcase_13 | AC | 240 ms
51,728 KB |
testcase_14 | AC | 170 ms
51,444 KB |
testcase_15 | AC | 158 ms
51,408 KB |
testcase_16 | AC | 150 ms
52,472 KB |
testcase_17 | AC | 127 ms
50,672 KB |
testcase_18 | AC | 231 ms
52,364 KB |
testcase_19 | AC | 105 ms
50,444 KB |
testcase_20 | AC | 190 ms
51,856 KB |
testcase_21 | AC | 132 ms
50,948 KB |
testcase_22 | AC | 45 ms
49,260 KB |
testcase_23 | AC | 44 ms
49,368 KB |
testcase_24 | AC | 48 ms
49,464 KB |
testcase_25 | AC | 67 ms
50,696 KB |
testcase_26 | AC | 241 ms
52,504 KB |
testcase_27 | AC | 240 ms
51,760 KB |
ソースコード
package contest170609; import java.io.ByteArrayInputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.InputMismatchException; public class D { InputStream is; PrintWriter out; String INPUT = ""; void solve() { char[] s = ns().toCharArray(); out.println(go(s, 1000000000)); out.println(go(s, 1000000007)); } long go(char[] s, int mod) { int n = s.length; long ret = 0; boolean lower = false; for(int i = (n+1)/2-1;i >= 0;i--){ if(s[i] > s[n-1-i]){ lower = true; break; }else if(s[i] < s[n-1-i]){ break; } } long plus = 0; for(int i = 0;i < (n+1)/2;i++){ plus = plus * 10 + (i == 0 ? s[i]-'0' - 1 : s[i]-'0'); plus %= mod; } ret += plus + (lower ? 0 : 1); for(int i = n-1;i >= 1;i--){ ret += pow(10, (i+1)/2, mod) - pow(10, (i+1)/2-1, mod); } ret %= mod; if(ret < 0)ret += mod; return ret; } public static long pow(long a, long n, long mod) { // a %= mod; long ret = 1; int x = 63 - Long.numberOfLeadingZeros(n); for (; x >= 0; x--) { ret = ret * ret % mod; if (n << 63 - x < 0) ret = ret * a % mod; } return ret; } void run() throws Exception { is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes()); out = new PrintWriter(System.out); long s = System.currentTimeMillis(); solve(); out.flush(); if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); // Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){ // @Override // public void run() { // long s = System.currentTimeMillis(); // solve(); // out.flush(); // if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); // } // }; // t.start(); // t.join(); } public static void main(String[] args) throws Exception { new D().run(); } private byte[] inbuf = new byte[1024]; public int lenbuf = 0, ptrbuf = 0; private int readByte() { if(lenbuf == -1)throw new InputMismatchException(); if(ptrbuf >= lenbuf){ ptrbuf = 0; try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); } if(lenbuf <= 0)return -1; } return inbuf[ptrbuf++]; } private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); } private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; } private double nd() { return Double.parseDouble(ns()); } private char nc() { return (char)skip(); } private String ns() { int b = skip(); StringBuilder sb = new StringBuilder(); while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ') sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } private char[] ns(int n) { char[] buf = new char[n]; int b = skip(), p = 0; while(p < n && !(isSpaceChar(b))){ buf[p++] = (char)b; b = readByte(); } return n == p ? buf : Arrays.copyOf(buf, p); } private int[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private long[] nal(int n) { long[] a = new long[n]; for(int i = 0;i < n;i++)a[i] = nl(); return a; } private char[][] nm(int n, int m) { char[][] map = new char[n][]; for(int i = 0;i < n;i++)map[i] = ns(m); return map; } private int[][] nmi(int n, int m) { int[][] map = new int[n][]; for(int i = 0;i < n;i++)map[i] = na(m); return map; } private int ni() { return (int)nl(); } private long nl() { long num = 0; int b; boolean minus = false; while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')); if(b == '-'){ minus = true; b = readByte(); } while(true){ if(b >= '0' && b <= '9'){ num = num * 10 + (b - '0'); }else{ return minus ? -num : num; } b = readByte(); } } private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); } }