結果

問題 No.793 うし数列 2
ユーザー hiromi_ayasehiromi_ayase
提出日時 2019-02-22 21:32:11
言語 Java21
(openjdk 21)
結果
AC  
実行時間 76 ms / 2,000 ms
コード長 3,245 bytes
コンパイル時間 2,477 ms
コンパイル使用メモリ 88,872 KB
実行使用メモリ 38,448 KB
最終ジャッジ日時 2024-05-03 23:57:42
合計ジャッジ時間 5,045 ms
ジャッジサーバーID
(参考情報)
judge3 / judge5
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 72 ms
38,436 KB
testcase_01 AC 70 ms
38,160 KB
testcase_02 AC 72 ms
37,884 KB
testcase_03 AC 69 ms
38,184 KB
testcase_04 AC 69 ms
38,300 KB
testcase_05 AC 69 ms
38,120 KB
testcase_06 AC 70 ms
38,436 KB
testcase_07 AC 71 ms
38,300 KB
testcase_08 AC 70 ms
38,012 KB
testcase_09 AC 70 ms
37,900 KB
testcase_10 AC 73 ms
38,184 KB
testcase_11 AC 75 ms
38,012 KB
testcase_12 AC 76 ms
38,168 KB
testcase_13 AC 73 ms
38,288 KB
testcase_14 AC 72 ms
38,448 KB
testcase_15 AC 71 ms
38,436 KB
testcase_16 AC 75 ms
37,884 KB
testcase_17 AC 71 ms
38,396 KB
testcase_18 AC 71 ms
38,288 KB
testcase_19 AC 70 ms
38,396 KB
testcase_20 AC 70 ms
38,184 KB
testcase_21 AC 69 ms
38,288 KB
testcase_22 AC 72 ms
38,320 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

public class Main {


  private static void solve() {
    long n = nl();
    
    //a[0] = 1, a[n] = a[n-1]*10 + 3
    //a[n] + 1/3 = 10(a[n] + 1/3)
    //a[n] = 10^n * 4/3 - 1/3
    
    
    int mod = 1000000000 + 7;
    long inv3 = invl(3, mod);
    
    long e = pow(10, n, mod) * 4 % mod * inv3 % mod + mod - inv3;
    e %= mod;
    
    System.out.println(e);
  }

  public static long invl(long a, long mod)
  {
      long b = mod;
      long p = 1, q = 0;
      while(b > 0){
          long c = a / b;
          long d;
          d = a; a = b; b = d % b;
          d = p; p = q; q = d - c * q;
      }
      return p < 0 ? p + mod : p;
  }
  
  public static long pow(long a, long n, long mod)
  {
      long ret = 1;
      int x = 63-Long.numberOfLeadingZeros(n);
      for(;x >= 0;x--){
          ret = ret * ret % mod;
          if(n<<~x<0)ret = ret * a % mod;
      }
      return ret;
  }
  
  public static void main(String[] args) {
    new Thread(null, new Runnable() {
      @Override
      public void run() {
        long start = System.currentTimeMillis();
        String debug = args.length > 0 ? args[0] : null;
        if (debug != null) {
          try {
            is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug));
          } catch (Exception e) {
            throw new RuntimeException(e);
          }
        }
        reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768);
        solve();
        out.flush();
        tr((System.currentTimeMillis() - start) + "ms");
      }
    }, "", 64000000).start();
  }

  private static java.io.InputStream is = System.in;
  private static java.io.PrintWriter out = new java.io.PrintWriter(System.out);
  private static java.util.StringTokenizer tokenizer = null;
  private static java.io.BufferedReader reader;

  public static String next() {
    while (tokenizer == null || !tokenizer.hasMoreTokens()) {
      try {
        tokenizer = new java.util.StringTokenizer(reader.readLine());
      } catch (Exception e) {
        throw new RuntimeException(e);
      }
    }
    return tokenizer.nextToken();
  }

  private static double nd() {
    return Double.parseDouble(next());
  }

  private static long nl() {
    return Long.parseLong(next());
  }

  private static int[] na(int n) {
    int[] a = new int[n];
    for (int i = 0; i < n; i++)
      a[i] = ni();
    return a;
  }

  private static char[] ns() {
    return next().toCharArray();
  }

  private static long[] nal(int n) {
    long[] a = new long[n];
    for (int i = 0; i < n; i++)
      a[i] = nl();
    return a;
  }

  private static int[][] ntable(int n, int m) {
    int[][] table = new int[n][m];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        table[i][j] = ni();
      }
    }
    return table;
  }

  private static int[][] nlist(int n, int m) {
    int[][] table = new int[m][n];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        table[j][i] = ni();
      }
    }
    return table;
  }

  private static int ni() {
    return Integer.parseInt(next());
  }

  private static void tr(Object... o) {
    if (is != System.in)
      System.out.println(java.util.Arrays.deepToString(o));
  }
}
0